Information on Result #860997
Linear OOA(2556, 195330, F25, 2, 13) (dual of [(195330, 2), 390604, 14]-NRT-code), using OOA 2-folding based on linear OA(2556, 390660, F25, 13) (dual of [390660, 390604, 14]-code), using
- discarding factors / shortening the dual code based on linear OA(2556, 390661, F25, 13) (dual of [390661, 390605, 14]-code), using
- (u, u+v)-construction [i] based on
- linear OA(256, 26, F25, 6) (dual of [26, 20, 7]-code or 26-arc in PG(5,25)), using
- extended Reed–Solomon code RSe(20,25) [i]
- algebraic-geometric code AG(F, Q+8P) with degQ = 3 and degPÂ =Â 2 [i] based on function field F/F25 with g(F) = 0 and N(F) ≥ 26, using the rational function field F25(x) [i]
- algebraic-geometric code AG(F, Q+5P) with degQ = 4 and degPÂ =Â 3 [i] based on function field F/F25 with g(F) = 0 and N(F) ≥ 26 (see above)
- linear OA(2550, 390635, F25, 13) (dual of [390635, 390585, 14]-code), using
- construction X applied to C([0,6]) ⊂ C([0,5]) [i] based on
- linear OA(2549, 390626, F25, 13) (dual of [390626, 390577, 14]-code), using the expurgated narrow-sense BCH-code C(I) with length 390626 | 258−1, defining interval I = [0,6], and minimum distance d ≥ |{−6,−5,…,6}|+1 = 14 (BCH-bound) [i]
- linear OA(2541, 390626, F25, 11) (dual of [390626, 390585, 12]-code), using the expurgated narrow-sense BCH-code C(I) with length 390626 | 258−1, defining interval I = [0,5], and minimum distance d ≥ |{−5,−4,…,5}|+1 = 12 (BCH-bound) [i]
- linear OA(251, 9, F25, 1) (dual of [9, 8, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(251, s, F25, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- construction X applied to C([0,6]) ⊂ C([0,5]) [i] based on
- linear OA(256, 26, F25, 6) (dual of [26, 20, 7]-code or 26-arc in PG(5,25)), using
- (u, u+v)-construction [i] based on
Mode: Constructive and linear.
Optimality
Show details for fixed k and m, n and k, k and s, k and t, n and m, m and s, m and t, n and s, n and t.
Other Results with Identical Parameters
None.
Depending Results
None.