Information on Result #716507
Linear OA(8155, 562, F8, 52) (dual of [562, 407, 53]-code), using construction XX applied to C1 = C([503,37]), C2 = C([0,43]), C3 = C1 + C2 = C([0,37]), and C∩ = C1 ∩ C2 = C([503,43]) based on
- linear OA(8121, 511, F8, 46) (dual of [511, 390, 47]-code), using the primitive BCH-code C(I) with length 511 = 83−1, defining interval I = {−8,−7,…,37}, and designed minimum distance d ≥ |I|+1 = 47 [i]
- linear OA(8115, 511, F8, 44) (dual of [511, 396, 45]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,43], and designed minimum distance d ≥ |I|+1 = 45 [i]
- linear OA(8136, 511, F8, 52) (dual of [511, 375, 53]-code), using the primitive BCH-code C(I) with length 511 = 83−1, defining interval I = {−8,−7,…,43}, and designed minimum distance d ≥ |I|+1 = 53 [i]
- linear OA(8100, 511, F8, 38) (dual of [511, 411, 39]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,37], and designed minimum distance d ≥ |I|+1 = 39 [i]
- linear OA(812, 29, F8, 7) (dual of [29, 17, 8]-code), using
- (u, u−v, u+v+w)-construction [i] based on
- linear OA(82, 9, F8, 2) (dual of [9, 7, 3]-code or 9-arc in PG(1,8)), using
- extended Reed–Solomon code RSe(7,8) [i]
- Hamming code H(2,8) [i]
- linear OA(83, 10, F8, 3) (dual of [10, 7, 4]-code or 10-arc in PG(2,8) or 10-cap in PG(2,8)), using
- linear OA(87, 10, F8, 7) (dual of [10, 3, 8]-code or 10-arc in PG(6,8)), using
- Denniston code D(1,8) [i]
- linear OA(82, 9, F8, 2) (dual of [9, 7, 3]-code or 9-arc in PG(1,8)), using
- (u, u−v, u+v+w)-construction [i] based on
- linear OA(87, 22, F8, 5) (dual of [22, 15, 6]-code), using
- discarding factors / shortening the dual code based on linear OA(87, 57, F8, 5) (dual of [57, 50, 6]-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.