Information on Result #1052621
Linear OOA(2106, 136, F2, 4, 22) (dual of [(136, 4), 438, 23]-NRT-code), using OOA 4-folding based on linear OA(2106, 544, F2, 22) (dual of [544, 438, 23]-code), using
- 1 times truncation [i] based on linear OA(2107, 545, F2, 23) (dual of [545, 438, 24]-code), using
- construction XX applied to C1 = C([507,16]), C2 = C([0,18]), C3 = C1 + C2 = C([0,16]), and C∩ = C1 ∩ C2 = C([507,18]) [i] based on
- linear OA(291, 511, F2, 21) (dual of [511, 420, 22]-code), using the primitive BCH-code C(I) with length 511 = 29−1, defining interval I = {−4,−3,…,16}, and designed minimum distance d ≥ |I|+1 = 22 [i]
- linear OA(282, 511, F2, 19) (dual of [511, 429, 20]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 29−1, defining interval I = [0,18], and designed minimum distance d ≥ |I|+1 = 20 [i]
- linear OA(2100, 511, F2, 23) (dual of [511, 411, 24]-code), using the primitive BCH-code C(I) with length 511 = 29−1, defining interval I = {−4,−3,…,18}, and designed minimum distance d ≥ |I|+1 = 24 [i]
- linear OA(273, 511, F2, 17) (dual of [511, 438, 18]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 29−1, defining interval I = [0,16], and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(26, 24, F2, 3) (dual of [24, 18, 4]-code or 24-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
- linear OA(21, 10, F2, 1) (dual of [10, 9, 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 XX applied to C1 = C([507,16]), C2 = C([0,18]), C3 = C1 + C2 = C([0,16]), and C∩ = C1 ∩ C2 = C([507,18]) [i] based on
Mode: Constructive and linear.
Optimality
Show details for fixed k and m, n and k, k and s, k and t, n and m, m and s, m and t, n and s, n and t.
Other Results with Identical Parameters
None.
Depending Results
None.