Information on Result #991375
Linear OOA(8154, 2243, F81, 3, 20) (dual of [(2243, 3), 6675, 21]-NRT-code), using OOA 3-folding based on linear OA(8154, 6729, F81, 20) (dual of [6729, 6675, 21]-code), using
- (u, u+v)-construction [i] based on
- linear OA(8115, 166, F81, 10) (dual of [166, 151, 11]-code), using
- construction X applied to C([36,45]) ⊂ C([37,45]) [i] based on
- linear OA(8115, 164, F81, 10) (dual of [164, 149, 11]-code), using the BCH-code C(I) with length 164 | 812−1, defining interval I = {36,37,…,45}, and designed minimum distance d ≥ |I|+1 = 11 [i]
- linear OA(8113, 164, F81, 9) (dual of [164, 151, 10]-code), using the BCH-code C(I) with length 164 | 812−1, defining interval I = {37,38,…,45}, and designed minimum distance d ≥ |I|+1 = 10 [i]
- linear OA(810, 2, F81, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(810, s, F81, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to C([36,45]) ⊂ C([37,45]) [i] based on
- linear OA(8139, 6563, F81, 20) (dual of [6563, 6524, 21]-code), using
- construction X applied to Ce(19) ⊂ Ce(18) [i] based on
- linear OA(8139, 6561, F81, 20) (dual of [6561, 6522, 21]-code), using an extension Ce(19) of the primitive narrow-sense BCH-code C(I) with length 6560 = 812−1, defining interval I = [1,19], and designed minimum distance d ≥ |I|+1 = 20 [i]
- linear OA(8137, 6561, F81, 19) (dual of [6561, 6524, 20]-code), using an extension Ce(18) of the primitive narrow-sense BCH-code C(I) with length 6560 = 812−1, defining interval I = [1,18], and designed minimum distance d ≥ |I|+1 = 19 [i]
- linear OA(810, 2, F81, 0) (dual of [2, 2, 1]-code) (see above)
- construction X applied to Ce(19) ⊂ Ce(18) [i] based on
- linear OA(8115, 166, F81, 10) (dual of [166, 151, 11]-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.