Information on Result #718110
Linear OA(967, 97, F9, 42) (dual of [97, 30, 43]-code), using construction XX applied to C1 = C([0,40]), C2 = C([8,41]), C3 = C1 + C2 = C([8,40]), and C∩ = C1 ∩ C2 = C([0,41]) based on
- linear OA(957, 80, F9, 41) (dual of [80, 23, 42]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 80 = 92−1, defining interval I = [0,40], and designed minimum distance d ≥ |I|+1 = 42 [i]
- linear OA(952, 80, F9, 34) (dual of [80, 28, 35]-code), using the primitive BCH-code C(I) with length 80 = 92−1, defining interval I = {8,9,…,41}, and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(959, 80, F9, 42) (dual of [80, 21, 43]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 80 = 92−1, defining interval I = [0,41], and designed minimum distance d ≥ |I|+1 = 43 [i]
- linear OA(950, 80, F9, 33) (dual of [80, 30, 34]-code), using the primitive BCH-code C(I) with length 80 = 92−1, defining interval I = {8,9,…,40}, and designed minimum distance d ≥ |I|+1 = 34 [i]
- linear OA(98, 15, F9, 7) (dual of [15, 7, 8]-code), using
- discarding factors / shortening the dual code based on linear OA(98, 18, F9, 7) (dual of [18, 10, 8]-code), using
- 2 times truncation [i] based on linear OA(910, 20, F9, 9) (dual of [20, 10, 10]-code), using
- extended quadratic residue code Qe(20,9) [i]
- 2 times truncation [i] based on linear OA(910, 20, F9, 9) (dual of [20, 10, 10]-code), using
- discarding factors / shortening the dual code based on linear OA(98, 18, F9, 7) (dual of [18, 10, 8]-code), using
- linear OA(90, 2, F9, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(90, s, F9, 0) (dual of [s, s, 1]-code) for arbitrarily large s, 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.
Compare with Markus Grassl’s online database of code parameters.
Other Results with Identical Parameters
None.
Depending Results
None.