Information on Result #961730
Linear OOA(467, 344, F4, 3, 18) (dual of [(344, 3), 965, 19]-NRT-code), using OOA 3-folding based on linear OA(467, 1032, F4, 18) (dual of [1032, 965, 19]-code), using
- discarding factors / shortening the dual code based on linear OA(467, 1034, F4, 18) (dual of [1034, 967, 19]-code), using
- construction XX applied to C1 = C([325,341]), C2 = C([327,342]), C3 = C1 + C2 = C([327,341]), and C∩ = C1 ∩ C2 = C([325,342]) [i] based on
- linear OA(461, 1023, F4, 17) (dual of [1023, 962, 18]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {325,326,…,341}, and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(461, 1023, F4, 16) (dual of [1023, 962, 17]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {327,328,…,342}, and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(466, 1023, F4, 18) (dual of [1023, 957, 19]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {325,326,…,342}, and designed minimum distance d ≥ |I|+1 = 19 [i]
- linear OA(456, 1023, F4, 15) (dual of [1023, 967, 16]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {327,328,…,341}, and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(41, 6, F4, 1) (dual of [6, 5, 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(40, 5, F4, 0) (dual of [5, 5, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(40, s, F4, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction XX applied to C1 = C([325,341]), C2 = C([327,342]), C3 = C1 + C2 = C([327,341]), and C∩ = C1 ∩ C2 = C([325,342]) [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.