Information on Result #1407560
Linear OOA(357, 182, F3, 2, 17) (dual of [(182, 2), 307, 18]-NRT-code), using embedding of OOA with Gilbert–Varšamov bound based on linear OA(357, 182, F3, 17) (dual of [182, 125, 18]-code), using
- discarding factors / shortening the dual code based on linear OA(357, 253, F3, 17) (dual of [253, 196, 18]-code), using
- construction XX applied to C1 = C([106,121]), C2 = C([108,122]), C3 = C1 + C2 = C([108,121]), and C∩ = C1 ∩ C2 = C([106,122]) [i] based on
- linear OA(351, 242, F3, 16) (dual of [242, 191, 17]-code), using the primitive BCH-code C(I) with length 242 = 35−1, defining interval I = {106,107,…,121}, and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(351, 242, F3, 15) (dual of [242, 191, 16]-code), using the primitive BCH-code C(I) with length 242 = 35−1, defining interval I = {108,109,…,122}, and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(356, 242, F3, 17) (dual of [242, 186, 18]-code), using the primitive BCH-code C(I) with length 242 = 35−1, defining interval I = {106,107,…,122}, and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(346, 242, F3, 14) (dual of [242, 196, 15]-code), using the primitive BCH-code C(I) with length 242 = 35−1, defining interval I = {108,109,…,121}, and designed minimum distance d ≥ |I|+1 = 15 [i]
- linear OA(31, 6, F3, 1) (dual of [6, 5, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(31, s, F3, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- linear OA(30, 5, F3, 0) (dual of [5, 5, 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
- construction XX applied to C1 = C([106,121]), C2 = C([108,122]), C3 = C1 + C2 = C([108,121]), and C∩ = C1 ∩ C2 = C([106,122]) [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.