Information on Result #2265579
Linear OA(351, 86, F3, 21) (dual of [86, 35, 22]-code), using 2 times code embedding in larger space based on linear OA(349, 84, F3, 21) (dual of [84, 35, 22]-code), using
- construction XX applied to C1 = C({0,4,5,7,8,13,14,17,22,25,41,44,50}), C2 = C({0,4,5,7,8,10,13,14,17,22,25,41,44}), C3 = C1 + C2 = C({0,4,5,7,8,13,14,17,22,25,41,44}), and C∩ = C1 ∩ C2 = C({0,4,5,7,8,10,13,14,17,22,25,41,44,50}) [i] based on
- linear OA(347, 80, F3, 20) (dual of [80, 33, 21]-code), using the primitive cyclic code C(A) with length 80 = 34−1, defining set A = {0,4,5,7,8,13,14,17,22,25,41,44,50}, and minimum distance d ≥ |{17,24,31,…,−10}|+1 = 21 (BCH-bound) [i]
- linear OA(347, 80, F3, 20) (dual of [80, 33, 21]-code), using the primitive cyclic code C(A) with length 80 = 34−1, defining set A = {0,4,5,7,8,10,13,14,17,22,25,41,44}, and minimum distance d ≥ |{10,17,24,…,−17}|+1 = 21 (BCH-bound) [i]
- linear OA(349, 80, F3, 21) (dual of [80, 31, 22]-code), using the primitive cyclic code C(A) with length 80 = 34−1, defining set A = {0,4,5,7,8,10,13,14,17,22,25,41,44,50}, and minimum distance d ≥ |{10,17,24,…,−10}|+1 = 22 (BCH-bound) [i]
- linear OA(345, 80, F3, 19) (dual of [80, 35, 20]-code), using the primitive cyclic code C(A) with length 80 = 34−1, defining set A = {0,4,5,7,8,13,14,17,22,25,41,44}, and minimum distance d ≥ |{17,24,31,…,−17}|+1 = 20 (BCH-bound) [i]
- linear OA(30, 2, F3, 0) (dual of [2, 2, 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, 2, F3, 0) (dual of [2, 2, 1]-code) (see above)
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.