Information on Result #1016305
Linear OOA(987, 19712, F9, 3, 17) (dual of [(19712, 3), 59049, 18]-NRT-code), using (u, u+v)-construction based on
- linear OOA(911, 28, F9, 3, 8) (dual of [(28, 3), 73, 9]-NRT-code), using
- extended algebraic-geometric NRT-code AGe(3;F,75P) [i] based on function field F/F9 with g(F) = 3 and N(F) ≥ 28, using
- the Hermitian function field over F9 [i]
- extended algebraic-geometric NRT-code AGe(3;F,75P) [i] based on function field F/F9 with g(F) = 3 and N(F) ≥ 28, using
- linear OOA(976, 19684, F9, 3, 17) (dual of [(19684, 3), 58976, 18]-NRT-code), using
- OOA 3-folding [i] based on linear OA(976, 59052, F9, 17) (dual of [59052, 58976, 18]-code), using
- discarding factors / shortening the dual code based on linear OA(976, 59054, F9, 17) (dual of [59054, 58978, 18]-code), using
- construction X applied to Ce(16) ⊂ Ce(15) [i] based on
- linear OA(976, 59049, F9, 17) (dual of [59049, 58973, 18]-code), using an extension Ce(16) of the primitive narrow-sense BCH-code C(I) with length 59048 = 95−1, defining interval I = [1,16], and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(971, 59049, F9, 16) (dual of [59049, 58978, 17]-code), using an extension Ce(15) of the primitive narrow-sense BCH-code C(I) with length 59048 = 95−1, defining interval I = [1,15], and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(90, 5, F9, 0) (dual of [5, 5, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(90, s, F9, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to Ce(16) ⊂ Ce(15) [i] based on
- discarding factors / shortening the dual code based on linear OA(976, 59054, F9, 17) (dual of [59054, 58978, 18]-code), using
- OOA 3-folding [i] based on linear OA(976, 59052, F9, 17) (dual of [59052, 58976, 18]-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.