Information on Result #718271
Linear OA(976, 95, F9, 52) (dual of [95, 19, 53]-code), using construction XX applied to C1 = C([0,50]), C2 = C([8,51]), C3 = C1 + C2 = C([8,50]), and C∩ = C1 ∩ C2 = C([0,51]) based on
- linear OA(966, 80, F9, 51) (dual of [80, 14, 52]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 80 = 92−1, defining interval I = [0,50], and designed minimum distance d ≥ |I|+1 = 52 [i]
- linear OA(963, 80, F9, 44) (dual of [80, 17, 45]-code), using the primitive BCH-code C(I) with length 80 = 92−1, defining interval I = {8,9,…,51}, and designed minimum distance d ≥ |I|+1 = 45 [i]
- linear OA(968, 80, F9, 52) (dual of [80, 12, 53]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 80 = 92−1, defining interval I = [0,51], and designed minimum distance d ≥ |I|+1 = 53 [i]
- linear OA(961, 80, F9, 43) (dual of [80, 19, 44]-code), using the primitive BCH-code C(I) with length 80 = 92−1, defining interval I = {8,9,…,50}, and designed minimum distance d ≥ |I|+1 = 44 [i]
- linear OA(98, 13, F9, 7) (dual of [13, 5, 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.