Information on Result #1678625
Linear OOA(238, 84, F2, 7, 10) (dual of [(84, 7), 550, 11]-NRT-code), using embedding of OOA with Gilbert–Varšamov bound based on linear OA(238, 84, F2, 10) (dual of [84, 46, 11]-code), using
- discarding factors / shortening the dual code based on linear OA(238, 144, F2, 10) (dual of [144, 106, 11]-code), using
- construction XX applied to C1 = C({0,1,3,5,63}), C2 = C([1,7]), C3 = C1 + C2 = C([1,5]), and C∩ = C1 ∩ C2 = C({0,1,3,5,7,63}) [i] based on
- linear OA(229, 127, F2, 9) (dual of [127, 98, 10]-code), using the primitive cyclic code C(A) with length 127 = 27−1, defining set A = {0,1,3,5,63}, and minimum distance d ≥ |{−2,−1,…,6}|+1 = 10 (BCH-bound) [i]
- linear OA(228, 127, F2, 8) (dual of [127, 99, 9]-code), using the primitive narrow-sense BCH-code C(I) with length 127 = 27−1, defining interval I = [1,7], and designed minimum distance d ≥ |I|+1 = 9 [i]
- linear OA(236, 127, F2, 11) (dual of [127, 91, 12]-code), using the primitive cyclic code C(A) with length 127 = 27−1, defining set A = {0,1,3,5,7,63}, and minimum distance d ≥ |{−2,−1,…,8}|+1 = 12 (BCH-bound) [i]
- linear OA(221, 127, F2, 6) (dual of [127, 106, 7]-code), using the primitive narrow-sense BCH-code C(I) with length 127 = 27−1, defining interval I = [1,6], and designed minimum distance d ≥ |I|+1 = 7 [i]
- linear OA(21, 9, F2, 1) (dual of [9, 8, 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
- linear OA(21, 8, F2, 1) (dual of [8, 7, 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 (see above)
- construction XX applied to C1 = C({0,1,3,5,63}), C2 = C([1,7]), C3 = C1 + C2 = C([1,5]), and C∩ = C1 ∩ C2 = C({0,1,3,5,7,63}) [i] based on
Mode: 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.