Information on Result #715781
Linear OA(8108, 552, F8, 36) (dual of [552, 444, 37]-code), using construction XX applied to C1 = C([503,25]), C2 = C([0,27]), C3 = C1 + C2 = C([0,25]), and C∩ = C1 ∩ C2 = C([503,27]) based on
- linear OA(888, 511, F8, 34) (dual of [511, 423, 35]-code), using the primitive BCH-code C(I) with length 511 = 83−1, defining interval I = {−8,−7,…,25}, and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(873, 511, F8, 28) (dual of [511, 438, 29]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,27], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(894, 511, F8, 36) (dual of [511, 417, 37]-code), using the primitive BCH-code C(I) with length 511 = 83−1, defining interval I = {−8,−7,…,27}, and designed minimum distance d ≥ |I|+1 = 37 [i]
- linear OA(867, 511, F8, 26) (dual of [511, 444, 27]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,25], and designed minimum distance d ≥ |I|+1 = 27 [i]
- linear OA(813, 34, F8, 7) (dual of [34, 21, 8]-code), using
- discarding factors / shortening the dual code based on linear OA(813, 63, F8, 7) (dual of [63, 50, 8]-code), using
- the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 82−1, defining interval I = [0,6], and designed minimum distance d ≥ |I|+1 = 8 [i]
- discarding factors / shortening the dual code based on linear OA(813, 63, F8, 7) (dual of [63, 50, 8]-code), using
- linear OA(81, 7, F8, 1) (dual of [7, 6, 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.