Information on Result #1384409
Linear OOA(3289, 686, F32, 2, 40) (dual of [(686, 2), 1283, 41]-NRT-code), using OOA 2-folding based on linear OA(3289, 1372, F32, 40) (dual of [1372, 1283, 41]-code), using
- 332 step Varšamov–Edel lengthening with (ri) = (5, 1, 1, 0, 0, 0, 1, 9 times 0, 1, 18 times 0, 1, 35 times 0, 1, 60 times 0, 1, 89 times 0, 1, 109 times 0) [i] based on linear OA(3276, 1027, F32, 40) (dual of [1027, 951, 41]-code), using
- construction XX applied to C1 = C([1022,37]), C2 = C([0,38]), C3 = C1 + C2 = C([0,37]), and C∩ = C1 ∩ C2 = C([1022,38]) [i] based on
- linear OA(3274, 1023, F32, 39) (dual of [1023, 949, 40]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {−1,0,…,37}, and designed minimum distance d ≥ |I|+1 = 40 [i]
- linear OA(3274, 1023, F32, 39) (dual of [1023, 949, 40]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 322−1, defining interval I = [0,38], and designed minimum distance d ≥ |I|+1 = 40 [i]
- linear OA(3276, 1023, F32, 40) (dual of [1023, 947, 41]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {−1,0,…,38}, and designed minimum distance d ≥ |I|+1 = 41 [i]
- linear OA(3272, 1023, F32, 38) (dual of [1023, 951, 39]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 322−1, defining interval I = [0,37], and designed minimum distance d ≥ |I|+1 = 39 [i]
- linear OA(320, 2, F32, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(320, s, F32, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- linear OA(320, 2, F32, 0) (dual of [2, 2, 1]-code) (see above)
- construction XX applied to C1 = C([1022,37]), C2 = C([0,38]), C3 = C1 + C2 = C([0,37]), and C∩ = C1 ∩ C2 = C([1022,38]) [i] based on
Mode: 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.