Information on Result #1754220
Digital (164, 185, 42671)-net over F2, using embedding of OOA with Gilbert–Varšamov bound based on linear OOA(2185, 42671, F2, 6, 21) (dual of [(42671, 6), 255841, 22]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(2185, 43694, F2, 6, 21) (dual of [(43694, 6), 261979, 22]-NRT-code), using
- 22 times duplication [i] based on linear OOA(2183, 43694, F2, 6, 21) (dual of [(43694, 6), 261981, 22]-NRT-code), using
- OOA 6-folding [i] based on linear OA(2183, 262164, F2, 21) (dual of [262164, 261981, 22]-code), using
- 1 times code embedding in larger space [i] based on linear OA(2182, 262163, F2, 21) (dual of [262163, 261981, 22]-code), using
- construction X applied to Ce(20) ⊂ Ce(18) [i] based on
- linear OA(2181, 262144, F2, 21) (dual of [262144, 261963, 22]-code), using an extension Ce(20) of the primitive narrow-sense BCH-code C(I) with length 262143 = 218−1, defining interval I = [1,20], and designed minimum distance d ≥ |I|+1 = 21 [i]
- linear OA(2163, 262144, F2, 19) (dual of [262144, 261981, 20]-code), using an extension Ce(18) of the primitive narrow-sense BCH-code C(I) with length 262143 = 218−1, defining interval I = [1,18], and designed minimum distance d ≥ |I|+1 = 19 [i]
- linear OA(21, 19, F2, 1) (dual of [19, 18, 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(20) ⊂ Ce(18) [i] based on
- 1 times code embedding in larger space [i] based on linear OA(2182, 262163, F2, 21) (dual of [262163, 261981, 22]-code), using
- OOA 6-folding [i] based on linear OA(2183, 262164, F2, 21) (dual of [262164, 261981, 22]-code), using
- 22 times duplication [i] based on linear OOA(2183, 43694, F2, 6, 21) (dual of [(43694, 6), 261981, 22]-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.