Information on Result #1070413
Linear OOA(12844, 4192, F128, 4, 17) (dual of [(4192, 4), 16724, 18]-NRT-code), using OOA 2-folding based on linear OOA(12844, 8384, F128, 2, 17) (dual of [(8384, 2), 16724, 18]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(12844, 8385, F128, 2, 17) (dual of [(8385, 2), 16726, 18]-NRT-code), using
- (u, u+v)-construction [i] based on
- linear OOA(12811, 192, F128, 2, 8) (dual of [(192, 2), 373, 9]-NRT-code), using
- extended algebraic-geometric NRT-code AGe(2;F,375P) [i] based on function field F/F128 with g(F) = 3 and N(F) ≥ 192, using
- linear OOA(12833, 8193, F128, 2, 17) (dual of [(8193, 2), 16353, 18]-NRT-code), using
- OOA 2-folding [i] based on linear OA(12833, 16386, F128, 17) (dual of [16386, 16353, 18]-code), using
- construction X applied to Ce(16) ⊂ Ce(15) [i] based on
- linear OA(12833, 16384, F128, 17) (dual of [16384, 16351, 18]-code), using an extension Ce(16) of the primitive narrow-sense BCH-code C(I) with length 16383 = 1282−1, defining interval I = [1,16], and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(12831, 16384, F128, 16) (dual of [16384, 16353, 17]-code), using an extension Ce(15) of the primitive narrow-sense BCH-code C(I) with length 16383 = 1282−1, defining interval I = [1,15], and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(1280, 2, F128, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(1280, s, F128, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to Ce(16) ⊂ Ce(15) [i] based on
- OOA 2-folding [i] based on linear OA(12833, 16386, F128, 17) (dual of [16386, 16353, 18]-code), using
- linear OOA(12811, 192, F128, 2, 8) (dual of [(192, 2), 373, 9]-NRT-code), using
- (u, u+v)-construction [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.