Information on Result #960639
Linear OOA(3242, 91, F3, 3, 133) (dual of [(91, 3), 31, 134]-NRT-code), using OOA 3-folding based on linear OA(3242, 273, F3, 133) (dual of [273, 31, 134]-code), using
- construction XX applied to C1 = C([233,121]), C2 = C([1,124]), C3 = C1 + C2 = C([1,121]), and C∩ = C1 ∩ C2 = C([233,124]) [i] based on
- linear OA(3222, 242, F3, 131) (dual of [242, 20, 132]-code), using the primitive BCH-code C(I) with length 242 = 35−1, defining interval I = {−9,−8,…,121}, and designed minimum distance d ≥ |I|+1 = 132 [i]
- linear OA(3216, 242, F3, 124) (dual of [242, 26, 125]-code), using the primitive narrow-sense BCH-code C(I) with length 242 = 35−1, defining interval I = [1,124], and designed minimum distance d ≥ |I|+1 = 125 [i]
- linear OA(3227, 242, F3, 134) (dual of [242, 15, 135]-code), using the primitive BCH-code C(I) with length 242 = 35−1, defining interval I = {−9,−8,…,124}, and designed minimum distance d ≥ |I|+1 = 135 [i]
- linear OA(3211, 242, F3, 121) (dual of [242, 31, 122]-code), using the primitive narrow-sense BCH-code C(I) with length 242 = 35−1, defining interval I = [1,121], and designed minimum distance d ≥ |I|+1 = 122 [i]
- linear OA(312, 23, F3, 8) (dual of [23, 11, 9]-code), using
- discarding factors / shortening the dual code based on linear OA(312, 24, F3, 8) (dual of [24, 12, 9]-code), using
- extended quadratic residue code Qe(24,3) [i]
- discarding factors / shortening the dual code based on linear OA(312, 24, F3, 8) (dual of [24, 12, 9]-code), using
- linear OA(33, 8, F3, 2) (dual of [8, 5, 3]-code), using
- discarding factors / shortening the dual code based on linear OA(33, 13, F3, 2) (dual of [13, 10, 3]-code), using
- Hamming code H(3,3) [i]
- discarding factors / shortening the dual code based on linear OA(33, 13, F3, 2) (dual of [13, 10, 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.