Information on Result #1054569
Linear OOA(2188, 140, F2, 4, 40) (dual of [(140, 4), 372, 41]-NRT-code), using OOA 4-folding based on linear OA(2188, 560, F2, 40) (dual of [560, 372, 41]-code), using
- discarding factors / shortening the dual code based on linear OA(2188, 561, F2, 40) (dual of [561, 373, 41]-code), using
- construction XX applied to C1 = C([505,30]), C2 = C([0,34]), C3 = C1 + C2 = C([0,30]), and C∩ = C1 ∩ C2 = C([505,34]) [i] based on
- linear OA(2163, 511, F2, 37) (dual of [511, 348, 38]-code), using the primitive BCH-code C(I) with length 511 = 29−1, defining interval I = {−6,−5,…,30}, and designed minimum distance d ≥ |I|+1 = 38 [i]
- linear OA(2145, 511, F2, 35) (dual of [511, 366, 36]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 29−1, defining interval I = [0,34], and designed minimum distance d ≥ |I|+1 = 36 [i]
- linear OA(2172, 511, F2, 41) (dual of [511, 339, 42]-code), using the primitive BCH-code C(I) with length 511 = 29−1, defining interval I = {−6,−5,…,34}, and designed minimum distance d ≥ |I|+1 = 42 [i]
- linear OA(2136, 511, F2, 31) (dual of [511, 375, 32]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 29−1, defining interval I = [0,30], and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(211, 36, F2, 4) (dual of [36, 25, 5]-code), using
- discarding factors / shortening the dual code based on linear OA(211, 44, F2, 4) (dual of [44, 33, 5]-code), using
- linear OA(25, 14, F2, 3) (dual of [14, 9, 4]-code or 14-cap in PG(4,2)), using
- discarding factors / shortening the dual code based on linear OA(25, 16, F2, 3) (dual of [16, 11, 4]-code or 16-cap in PG(4,2)), using
- construction XX applied to C1 = C([505,30]), C2 = C([0,34]), C3 = C1 + C2 = C([0,30]), and C∩ = C1 ∩ C2 = C([505,34]) [i] based on
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.