Information on Result #1759526
Digital (211, 252, 1382)-net over F2, using embedding of OOA with Gilbert–Varšamov bound based on linear OOA(2252, 1382, F2, 2, 41) (dual of [(1382, 2), 2512, 42]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(2252, 2066, F2, 2, 41) (dual of [(2066, 2), 3880, 42]-NRT-code), using
- 2 times NRT-code embedding in larger space [i] based on linear OOA(2248, 2064, F2, 2, 41) (dual of [(2064, 2), 3880, 42]-NRT-code), using
- OOA 2-folding [i] based on linear OA(2248, 4128, F2, 41) (dual of [4128, 3880, 42]-code), using
- 1 times code embedding in larger space [i] based on linear OA(2247, 4127, F2, 41) (dual of [4127, 3880, 42]-code), using
- construction X applied to C([0,20]) ⊂ C([0,18]) [i] based on
- linear OA(2241, 4097, F2, 41) (dual of [4097, 3856, 42]-code), using the expurgated narrow-sense BCH-code C(I) with length 4097 | 224−1, defining interval I = [0,20], and minimum distance d ≥ |{−20,−19,…,20}|+1 = 42 (BCH-bound) [i]
- linear OA(2217, 4097, F2, 37) (dual of [4097, 3880, 38]-code), using the expurgated narrow-sense BCH-code C(I) with length 4097 | 224−1, defining interval I = [0,18], and minimum distance d ≥ |{−18,−17,…,18}|+1 = 38 (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,20]) ⊂ C([0,18]) [i] based on
- 1 times code embedding in larger space [i] based on linear OA(2247, 4127, F2, 41) (dual of [4127, 3880, 42]-code), using
- OOA 2-folding [i] based on linear OA(2248, 4128, F2, 41) (dual of [4128, 3880, 42]-code), using
- 2 times NRT-code embedding in larger space [i] based on linear OOA(2248, 2064, F2, 2, 41) (dual of [(2064, 2), 3880, 42]-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.