Information on Result #1757832
Digital (208, 233, 72065)-net over F2, using embedding of OOA with Gilbert–Varšamov bound based on linear OOA(2233, 72065, F2, 7, 25) (dual of [(72065, 7), 504222, 26]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(2233, 74901, F2, 7, 25) (dual of [(74901, 7), 524074, 26]-NRT-code), using
- 23 times duplication [i] based on linear OOA(2230, 74901, F2, 7, 25) (dual of [(74901, 7), 524077, 26]-NRT-code), using
- OOA 7-folding [i] based on linear OA(2230, 524307, F2, 25) (dual of [524307, 524077, 26]-code), using
- discarding factors / shortening the dual code based on linear OA(2230, 524308, F2, 25) (dual of [524308, 524078, 26]-code), using
- construction X applied to Ce(24) ⊂ Ce(22) [i] based on
- linear OA(2229, 524288, F2, 25) (dual of [524288, 524059, 26]-code), using an extension Ce(24) of the primitive narrow-sense BCH-code C(I) with length 524287 = 219−1, defining interval I = [1,24], and designed minimum distance d ≥ |I|+1 = 25 [i]
- linear OA(2210, 524288, F2, 23) (dual of [524288, 524078, 24]-code), using an extension Ce(22) of the primitive narrow-sense BCH-code C(I) with length 524287 = 219−1, defining interval I = [1,22], and designed minimum distance d ≥ |I|+1 = 23 [i]
- linear OA(21, 20, F2, 1) (dual of [20, 19, 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 X applied to Ce(24) ⊂ Ce(22) [i] based on
- discarding factors / shortening the dual code based on linear OA(2230, 524308, F2, 25) (dual of [524308, 524078, 26]-code), using
- OOA 7-folding [i] based on linear OA(2230, 524307, F2, 25) (dual of [524307, 524077, 26]-code), using
- 23 times duplication [i] based on linear OOA(2230, 74901, F2, 7, 25) (dual of [(74901, 7), 524077, 26]-NRT-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.