Information on Result #683152
Linear OA(5135, 3155, F5, 32) (dual of [3155, 3020, 33]-code), using construction XX applied to Ce(31) ⊂ Ce(26) ⊂ Ce(25) based on
- linear OA(5126, 3125, F5, 32) (dual of [3125, 2999, 33]-code), using an extension Ce(31) of the primitive narrow-sense BCH-code C(I) with length 3124 = 55−1, defining interval I = [1,31], and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(5106, 3125, F5, 27) (dual of [3125, 3019, 28]-code), using an extension Ce(26) of the primitive narrow-sense BCH-code C(I) with length 3124 = 55−1, defining interval I = [1,26], and designed minimum distance d ≥ |I|+1 = 27 [i]
- linear OA(5101, 3125, F5, 26) (dual of [3125, 3024, 27]-code), using an extension Ce(25) of the primitive narrow-sense BCH-code C(I) with length 3124 = 55−1, defining interval I = [1,25], and designed minimum distance d ≥ |I|+1 = 26 [i]
- linear OA(58, 29, F5, 4) (dual of [29, 21, 5]-code), using
- discarding factors / shortening the dual code based on linear OA(58, 52, F5, 4) (dual of [52, 44, 5]-code), using
- trace code [i] based on linear OA(254, 26, F25, 4) (dual of [26, 22, 5]-code or 26-arc in PG(3,25)), using
- extended Reed–Solomon code RSe(22,25) [i]
- algebraic-geometric code AG(F, Q+9P) 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,7P) with degPÂ =Â 3 [i] based on function field F/F25 with g(F) = 0 and N(F) ≥ 26 (see above)
- trace code [i] based on linear OA(254, 26, F25, 4) (dual of [26, 22, 5]-code or 26-arc in PG(3,25)), using
- discarding factors / shortening the dual code based on linear OA(58, 52, F5, 4) (dual of [52, 44, 5]-code), using
- linear OA(50, 1, F5, 0) (dual of [1, 1, 1]-code), using
- dual of repetition code with length 1 [i]
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.