Information on Result #896186
Linear OOA(583, 7840, F5, 2, 15) (dual of [(7840, 2), 15597, 16]-NRT-code), using (u, u+v)-construction based on
- linear OOA(510, 25, F5, 2, 7) (dual of [(25, 2), 40, 8]-NRT-code), using
- extracting embedded OOA [i] based on digital (3, 10, 25)-net over F5, using
- linear OOA(573, 7815, F5, 2, 15) (dual of [(7815, 2), 15557, 16]-NRT-code), using
- OOA 2-folding [i] based on linear OA(573, 15630, F5, 15) (dual of [15630, 15557, 16]-code), using
- discarding factors / shortening the dual code based on linear OA(573, 15631, F5, 15) (dual of [15631, 15558, 16]-code), using
- 1 times truncation [i] based on linear OA(574, 15632, F5, 16) (dual of [15632, 15558, 17]-code), using
- construction X applied to Ce(15) ⊂ Ce(13) [i] based on
- linear OA(573, 15625, F5, 16) (dual of [15625, 15552, 17]-code), using an extension Ce(15) of the primitive narrow-sense BCH-code C(I) with length 15624 = 56−1, defining interval I = [1,15], and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(567, 15625, F5, 14) (dual of [15625, 15558, 15]-code), using an extension Ce(13) of the primitive narrow-sense BCH-code C(I) with length 15624 = 56−1, defining interval I = [1,13], and designed minimum distance d ≥ |I|+1 = 14 [i]
- linear OA(51, 7, F5, 1) (dual of [7, 6, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(51, s, F5, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- construction X applied to Ce(15) ⊂ Ce(13) [i] based on
- 1 times truncation [i] based on linear OA(574, 15632, F5, 16) (dual of [15632, 15558, 17]-code), using
- discarding factors / shortening the dual code based on linear OA(573, 15631, F5, 15) (dual of [15631, 15558, 16]-code), using
- OOA 2-folding [i] based on linear OA(573, 15630, F5, 15) (dual of [15630, 15557, 16]-code), using
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.