Information on Result #715335
Linear OA(876, 547, F8, 24) (dual of [547, 471, 25]-code), using construction XX applied to C1 = C([503,14]), C2 = C([0,16]), C3 = C1 + C2 = C([0,14]), and C∩ = C1 ∩ C2 = C([503,16]) based on
- linear OA(861, 511, F8, 23) (dual of [511, 450, 24]-code), using the primitive BCH-code C(I) with length 511 = 83−1, defining interval I = {−8,−7,…,14}, and designed minimum distance d ≥ |I|+1 = 24 [i]
- linear OA(843, 511, F8, 17) (dual of [511, 468, 18]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,16], and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(864, 511, F8, 25) (dual of [511, 447, 26]-code), using the primitive BCH-code C(I) with length 511 = 83−1, defining interval I = {−8,−7,…,16}, and designed minimum distance d ≥ |I|+1 = 26 [i]
- linear OA(840, 511, F8, 15) (dual of [511, 471, 16]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,14], and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(811, 32, F8, 6) (dual of [32, 21, 7]-code), using
- discarding factors / shortening the dual code based on linear OA(811, 63, F8, 6) (dual of [63, 52, 7]-code), using
- the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 82−1, defining interval I = [0,5], and designed minimum distance d ≥ |I|+1 = 7 [i]
- discarding factors / shortening the dual code based on linear OA(811, 63, F8, 6) (dual of [63, 52, 7]-code), using
- linear OA(81, 4, F8, 1) (dual of [4, 3, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(81, 8, F8, 1) (dual of [8, 7, 2]-code), using
- Reed–Solomon code RS(7,8) [i]
- discarding factors / shortening the dual code based on linear OA(81, 8, F8, 1) (dual of [8, 7, 2]-code), 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.
Other Results with Identical Parameters
None.
Depending Results
None.