Information on Result #1307863
Linear OA(451, 82, F4, 24) (dual of [82, 31, 25]-code), using 4 step Varšamov–Edel lengthening with (ri) = (4, 1, 1, 0) based on linear OA(445, 72, F4, 24) (dual of [72, 27, 25]-code), using
- construction X applied to C({1,3,5,7,9,11,13,22}) ⊂ C({1,3,5,7,9,11,13}) [i] based on
- linear OA(444, 65, F4, 24) (dual of [65, 21, 25]-code), using the cyclic code C(A) with length 65 | 46−1, defining set A = {1,3,5,7,9,11,13,22}, and minimum distance d ≥ |{−23,−21,−19,…,23}|+1 = 25 (BCH-bound) [i]
- linear OA(438, 65, F4, 22) (dual of [65, 27, 23]-code), using the cyclic code C(A) with length 65 | 46−1, defining set A = {1,3,5,7,9,11,13}, and minimum distance d ≥ |{−21,−19,−17,…,21}|+1 = 23 (BCH-bound) [i]
- linear OA(41, 7, F4, 1) (dual of [7, 6, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(41, s, F4, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
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.
Compare with Markus Grassl’s online database of code parameters.
Other Results with Identical Parameters
None.
Depending Results
None.