Information on Result #2175051
Linear OA(2147, 173, F2, 59) (dual of [173, 26, 60]-code), using adding a parity check bit based on linear OA(2146, 172, F2, 58) (dual of [172, 26, 59]-code), using
- construction XX applied to C1 = C({0,1,3,5,7,9,11,13,15,19,21,23,27,29,31,63}), C2 = C([1,47]), C3 = C1 + C2 = C([1,31]), and C∩ = C1 ∩ C2 = C({0,1,3,5,7,9,11,13,15,19,21,23,27,29,31,43,47,63}) [i] based on
- linear OA(2106, 127, F2, 47) (dual of [127, 21, 48]-code), using the primitive cyclic code C(A) with length 127 = 27−1, defining set A = {0,1,3,5,7,9,11,13,15,19,21,23,27,29,31,63}, and minimum distance d ≥ |{−4,−3,…,42}|+1 = 48 (BCH-bound) [i]
- linear OA(2112, 127, F2, 54) (dual of [127, 15, 55]-code), using the primitive narrow-sense BCH-code C(I) with length 127 = 27−1, defining interval I = [1,47], and designed minimum distance d ≥ |I|+1 = 55 [i]
- linear OA(2120, 127, F2, 63) (dual of [127, 7, 64]-code), using the primitive cyclic code C(A) with length 127 = 27−1, defining set A = {0,1,3,5,7,9,11,13,15,19,21,23,27,29,31,43,47,63}, and minimum distance d ≥ |{0,9,18,…,50}|+1 = 64 (BCH-bound) [i]
- linear OA(298, 127, F2, 42) (dual of [127, 29, 43]-code), using the primitive narrow-sense BCH-code C(I) with length 127 = 27−1, defining interval I = [1,42], and designed minimum distance d ≥ |I|+1 = 43 [i]
- linear OA(25, 13, F2, 3) (dual of [13, 8, 4]-code or 13-cap in PG(4,2)), using
- discarding factors / shortening the dual code based on linear OA(25, 16, F2, 3) (dual of [16, 11, 4]-code or 16-cap in PG(4,2)), using
- linear OA(221, 32, F2, 11) (dual of [32, 11, 12]-code), using
- an extension Ce(10) of the primitive narrow-sense BCH-code C(I) with length 31 = 25−1, defining interval I = [1,10], and designed minimum distance d ≥ |I|+1 = 11 [i]
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.
Compare with Markus Grassl’s online database of code parameters.
Other Results with Identical Parameters
None.
Depending Results
None.