Information on Result #1755492
Digital (170, 203, 1349)-net over F2, using embedding of OOA with Gilbert–Varšamov bound based on linear OOA(2203, 1349, F2, 3, 33) (dual of [(1349, 3), 3844, 34]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(2203, 1377, F2, 3, 33) (dual of [(1377, 3), 3928, 34]-NRT-code), using
- 1 times NRT-code embedding in larger space [i] based on linear OOA(2200, 1376, F2, 3, 33) (dual of [(1376, 3), 3928, 34]-NRT-code), using
- OOA 3-folding [i] based on linear OA(2200, 4128, F2, 33) (dual of [4128, 3928, 34]-code), using
- 1 times code embedding in larger space [i] based on linear OA(2199, 4127, F2, 33) (dual of [4127, 3928, 34]-code), using
- construction X applied to C([0,16]) ⊂ C([0,14]) [i] based on
- linear OA(2193, 4097, F2, 33) (dual of [4097, 3904, 34]-code), using the expurgated narrow-sense BCH-code C(I) with length 4097 | 224−1, defining interval I = [0,16], and minimum distance d ≥ |{−16,−15,…,16}|+1 = 34 (BCH-bound) [i]
- linear OA(2169, 4097, F2, 29) (dual of [4097, 3928, 30]-code), using the expurgated narrow-sense BCH-code C(I) with length 4097 | 224−1, defining interval I = [0,14], and minimum distance d ≥ |{−14,−13,…,14}|+1 = 30 (BCH-bound) [i]
- linear OA(26, 30, F2, 3) (dual of [30, 24, 4]-code or 30-cap in PG(5,2)), using
- discarding factors / shortening the dual code based on linear OA(26, 32, F2, 3) (dual of [32, 26, 4]-code or 32-cap in PG(5,2)), using
- construction X applied to C([0,16]) ⊂ C([0,14]) [i] based on
- 1 times code embedding in larger space [i] based on linear OA(2199, 4127, F2, 33) (dual of [4127, 3928, 34]-code), using
- OOA 3-folding [i] based on linear OA(2200, 4128, F2, 33) (dual of [4128, 3928, 34]-code), using
- 1 times NRT-code embedding in larger space [i] based on linear OOA(2200, 1376, F2, 3, 33) (dual of [(1376, 3), 3928, 34]-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.