Information on Result #3323881
Digital (109, 126, 6557)-net over F2, using 23 times duplication based on digital (106, 123, 6557)-net over F2, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(2123, 6557, F2, 5, 17) (dual of [(6557, 5), 32662, 18]-NRT-code), using
- OOA 5-folding [i] based on linear OA(2123, 32785, F2, 17) (dual of [32785, 32662, 18]-code), using
- discarding factors / shortening the dual code based on linear OA(2123, 32786, F2, 17) (dual of [32786, 32663, 18]-code), using
- adding a parity check bit [i] based on linear OA(2122, 32785, F2, 16) (dual of [32785, 32663, 17]-code), using
- construction X4 applied to C([0,16]) ⊂ C([1,14]) [i] based on
- linear OA(2121, 32767, F2, 17) (dual of [32767, 32646, 18]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 32767 = 215−1, defining interval I = [0,16], and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(2105, 32767, F2, 14) (dual of [32767, 32662, 15]-code), using the primitive narrow-sense BCH-code C(I) with length 32767 = 215−1, defining interval I = [1,14], and designed minimum distance d ≥ |I|+1 = 15 [i]
- linear OA(217, 18, F2, 17) (dual of [18, 1, 18]-code or 18-arc in PG(16,2)), using
- dual of repetition code with length 18 [i]
- linear OA(21, 18, F2, 1) (dual of [18, 17, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(21, s, F2, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- construction X4 applied to C([0,16]) ⊂ C([1,14]) [i] based on
- adding a parity check bit [i] based on linear OA(2122, 32785, F2, 16) (dual of [32785, 32663, 17]-code), using
- discarding factors / shortening the dual code based on linear OA(2123, 32786, F2, 17) (dual of [32786, 32663, 18]-code), using
- OOA 5-folding [i] based on linear OA(2123, 32785, F2, 17) (dual of [32785, 32662, 18]-code), using
Mode: Linear.
Optimality
Show details for fixed k and m, k and s, k and t, m and s, m and t, t and s.
Other Results with Identical Parameters
None.
Depending Results
None.