Information on Result #1019444
Linear OOA(12853, 5783, F128, 3, 19) (dual of [(5783, 3), 17296, 20]-NRT-code), using (u, u+v)-construction based on
- linear OOA(12816, 321, F128, 3, 9) (dual of [(321, 3), 947, 10]-NRT-code), using
- (u, u+v)-construction [i] based on
- linear OOA(1284, 129, F128, 3, 4) (dual of [(129, 3), 383, 5]-NRT-code), using
- extended Reed–Solomon NRT-code RSe(3;383,128) [i]
- linear OOA(12812, 192, F128, 3, 9) (dual of [(192, 3), 564, 10]-NRT-code), using
- extended algebraic-geometric NRT-code AGe(3;F,566P) [i] based on function field F/F128 with g(F) = 3 and N(F) ≥ 192, using
- linear OOA(1284, 129, F128, 3, 4) (dual of [(129, 3), 383, 5]-NRT-code), using
- (u, u+v)-construction [i] based on
- linear OOA(12837, 5462, F128, 3, 19) (dual of [(5462, 3), 16349, 20]-NRT-code), using
- OOA 3-folding [i] based on linear OA(12837, 16386, F128, 19) (dual of [16386, 16349, 20]-code), using
- construction X applied to Ce(18) ⊂ Ce(17) [i] based on
- linear OA(12837, 16384, F128, 19) (dual of [16384, 16347, 20]-code), using an extension Ce(18) of the primitive narrow-sense BCH-code C(I) with length 16383 = 1282−1, defining interval I = [1,18], and designed minimum distance d ≥ |I|+1 = 19 [i]
- linear OA(12835, 16384, F128, 18) (dual of [16384, 16349, 19]-code), using an extension Ce(17) of the primitive narrow-sense BCH-code C(I) with length 16383 = 1282−1, defining interval I = [1,17], and designed minimum distance d ≥ |I|+1 = 18 [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(18) ⊂ Ce(17) [i] based on
- OOA 3-folding [i] based on linear OA(12837, 16386, F128, 19) (dual of [16386, 16349, 20]-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.