Information on Result #717829
Linear OA(956, 99, F9, 32) (dual of [99, 43, 33]-code), using construction XX applied to C1 = C([0,30]), C2 = C([8,31]), C3 = C1 + C2 = C([8,30]), and C∩ = C1 ∩ C2 = C([0,31]) based on
- linear OA(946, 80, F9, 31) (dual of [80, 34, 32]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 80 = 92−1, defining interval I = [0,30], and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(939, 80, F9, 24) (dual of [80, 41, 25]-code), using the primitive BCH-code C(I) with length 80 = 92−1, defining interval I = {8,9,…,31}, and designed minimum distance d ≥ |I|+1 = 25 [i]
- linear OA(948, 80, F9, 32) (dual of [80, 32, 33]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 80 = 92−1, defining interval I = [0,31], and designed minimum distance d ≥ |I|+1 = 33 [i]
- linear OA(937, 80, F9, 23) (dual of [80, 43, 24]-code), using the primitive BCH-code C(I) with length 80 = 92−1, defining interval I = {8,9,…,30}, and designed minimum distance d ≥ |I|+1 = 24 [i]
- linear OA(98, 17, F9, 7) (dual of [17, 9, 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.