Information on Result #708245
Linear OA(4139, 1067, F4, 34) (dual of [1067, 928, 35]-code), using construction XX applied to C1 = C([1018,25]), C2 = C([1,28]), C3 = C1 + C2 = C([1,25]), and C∩ = C1 ∩ C2 = C([1018,28]) based on
- linear OA(4116, 1023, F4, 31) (dual of [1023, 907, 32]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−5,−4,…,25}, and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(4105, 1023, F4, 28) (dual of [1023, 918, 29]-code), using the primitive narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [1,28], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(4126, 1023, F4, 34) (dual of [1023, 897, 35]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−5,−4,…,28}, and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(495, 1023, F4, 25) (dual of [1023, 928, 26]-code), using the primitive narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [1,25], and designed minimum distance d ≥ |I|+1 = 26 [i]
- linear OA(410, 31, F4, 5) (dual of [31, 21, 6]-code), using
- discarding factors / shortening the dual code based on linear OA(410, 63, F4, 5) (dual of [63, 53, 6]-code), using
- the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 43−1, defining interval I = [0,3], and designed minimum distance d ≥ |I|+1 = 6 [i]
- discarding factors / shortening the dual code based on linear OA(410, 63, F4, 5) (dual of [63, 53, 6]-code), using
- linear OA(43, 13, F4, 2) (dual of [13, 10, 3]-code), using
- discarding factors / shortening the dual code based on linear OA(43, 21, F4, 2) (dual of [21, 18, 3]-code), using
- Hamming code H(3,4) [i]
- discarding factors / shortening the dual code based on linear OA(43, 21, F4, 2) (dual of [21, 18, 3]-code), using
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.