Information on Result #825679
Linear OOA(4138, 520, F4, 2, 36) (dual of [(520, 2), 902, 37]-NRT-code), using OOA 2-folding based on linear OA(4138, 1040, F4, 36) (dual of [1040, 902, 37]-code), using
- discarding factors / shortening the dual code based on linear OA(4138, 1041, F4, 36) (dual of [1041, 903, 37]-code), using
- construction XX applied to C1 = C([1022,32]), C2 = C([1,34]), C3 = C1 + C2 = C([1,32]), and C∩ = C1 ∩ C2 = C([1022,34]) [i] based on
- linear OA(4126, 1023, F4, 34) (dual of [1023, 897, 35]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,32}, and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(4130, 1023, F4, 34) (dual of [1023, 893, 35]-code), using the primitive narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [1,34], and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(4136, 1023, F4, 36) (dual of [1023, 887, 37]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,34}, and designed minimum distance d ≥ |I|+1 = 37 [i]
- linear OA(4120, 1023, F4, 32) (dual of [1023, 903, 33]-code), using the primitive narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [1,32], and designed minimum distance d ≥ |I|+1 = 33 [i]
- linear OA(41, 7, F4, 1) (dual of [7, 6, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(41, s, F4, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- linear OA(41, 11, F4, 1) (dual of [11, 10, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(41, s, F4, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s (see above)
- construction XX applied to C1 = C([1022,32]), C2 = C([1,34]), C3 = C1 + C2 = C([1,32]), and C∩ = C1 ∩ C2 = C([1022,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.