Information on Result #851249
Linear OOA(952, 370, F9, 2, 19) (dual of [(370, 2), 688, 20]-NRT-code), using OOA 2-folding based on linear OA(952, 740, F9, 19) (dual of [740, 688, 20]-code), using
- construction XX applied to C1 = C([84,100]), C2 = C([82,97]), C3 = C1 + C2 = C([84,97]), and C∩ = C1 ∩ C2 = C([82,100]) [i] based on
- linear OA(946, 728, F9, 17) (dual of [728, 682, 18]-code), using the primitive BCH-code C(I) with length 728 = 93−1, defining interval I = {84,85,…,100}, and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(943, 728, F9, 16) (dual of [728, 685, 17]-code), using the primitive BCH-code C(I) with length 728 = 93−1, defining interval I = {82,83,…,97}, and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(949, 728, F9, 19) (dual of [728, 679, 20]-code), using the primitive BCH-code C(I) with length 728 = 93−1, defining interval I = {82,83,…,100}, and designed minimum distance d ≥ |I|+1 = 20 [i]
- linear OA(940, 728, F9, 14) (dual of [728, 688, 15]-code), using the primitive BCH-code C(I) with length 728 = 93−1, defining interval I = {84,85,…,97}, and designed minimum distance d ≥ |I|+1 = 15 [i]
- linear OA(92, 8, F9, 2) (dual of [8, 6, 3]-code or 8-arc in PG(1,9)), using
- discarding factors / shortening the dual code based on linear OA(92, 9, F9, 2) (dual of [9, 7, 3]-code or 9-arc in PG(1,9)), using
- Reed–Solomon code RS(7,9) [i]
- discarding factors / shortening the dual code based on linear OA(92, 9, F9, 2) (dual of [9, 7, 3]-code or 9-arc in PG(1,9)), using
- linear OA(91, 4, F9, 1) (dual of [4, 3, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(91, 9, F9, 1) (dual of [9, 8, 2]-code), using
- Reed–Solomon code RS(8,9) [i]
- discarding factors / shortening the dual code based on linear OA(91, 9, F9, 1) (dual of [9, 8, 2]-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.