Information on Result #814955
Linear OOA(3118, 368, F3, 2, 30) (dual of [(368, 2), 618, 31]-NRT-code), using OOA 2-folding based on linear OA(3118, 736, F3, 30) (dual of [736, 618, 31]-code), using
- discarding factors / shortening the dual code based on linear OA(3118, 737, F3, 30) (dual of [737, 619, 31]-code), using
- construction XX applied to C1 = C([727,27]), C2 = C([0,28]), C3 = C1 + C2 = C([0,27]), and C∩ = C1 ∩ C2 = C([727,28]) [i] based on
- linear OA(3115, 728, F3, 29) (dual of [728, 613, 30]-code), using the primitive BCH-code C(I) with length 728 = 36−1, defining interval I = {−1,0,…,27}, and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(3112, 728, F3, 29) (dual of [728, 616, 30]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 728 = 36−1, defining interval I = [0,28], and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(3118, 728, F3, 30) (dual of [728, 610, 31]-code), using the primitive BCH-code C(I) with length 728 = 36−1, defining interval I = {−1,0,…,28}, and designed minimum distance d ≥ |I|+1 = 31 [i]
- linear OA(3109, 728, F3, 28) (dual of [728, 619, 29]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 728 = 36−1, defining interval I = [0,27], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(30, 6, F3, 0) (dual of [6, 6, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(30, s, F3, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- linear OA(30, 3, F3, 0) (dual of [3, 3, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(30, s, F3, 0) (dual of [s, s, 1]-code) for arbitrarily large s (see above)
- construction XX applied to C1 = C([727,27]), C2 = C([0,28]), C3 = C1 + C2 = C([0,27]), and C∩ = C1 ∩ C2 = C([727,28]) [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.