Information on Result #1015105
Linear OOA(8149, 10948, F8, 3, 30) (dual of [(10948, 3), 32695, 31]-NRT-code), using (u, u+v)-construction based on
- linear OOA(818, 24, F8, 3, 15) (dual of [(24, 3), 54, 16]-NRT-code), using
- extended algebraic-geometric NRT-code AGe(3;F,56P) [i] based on function field F/F8 with g(F) = 3 and N(F) ≥ 24, using
- the Klein quartic over F8 [i]
- extended algebraic-geometric NRT-code AGe(3;F,56P) [i] based on function field F/F8 with g(F) = 3 and N(F) ≥ 24, using
- linear OOA(8131, 10924, F8, 3, 30) (dual of [(10924, 3), 32641, 31]-NRT-code), using
- OOA 3-folding [i] based on linear OA(8131, 32772, F8, 30) (dual of [32772, 32641, 31]-code), using
- discarding factors / shortening the dual code based on linear OA(8131, 32773, F8, 30) (dual of [32773, 32642, 31]-code), using
- construction X applied to Ce(29) ⊂ Ce(28) [i] based on
- linear OA(8131, 32768, F8, 30) (dual of [32768, 32637, 31]-code), using an extension Ce(29) of the primitive narrow-sense BCH-code C(I) with length 32767 = 85−1, defining interval I = [1,29], and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(8126, 32768, F8, 29) (dual of [32768, 32642, 30]-code), using an extension Ce(28) of the primitive narrow-sense BCH-code C(I) with length 32767 = 85−1, defining interval I = [1,28], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(80, 5, F8, 0) (dual of [5, 5, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(80, s, F8, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to Ce(29) ⊂ Ce(28) [i] based on
- discarding factors / shortening the dual code based on linear OA(8131, 32773, F8, 30) (dual of [32773, 32642, 31]-code), using
- OOA 3-folding [i] based on linear OA(8131, 32772, F8, 30) (dual of [32772, 32641, 31]-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.