Information on Result #865055
Linear OOA(2719, 366, F27, 2, 10) (dual of [(366, 2), 713, 11]-NRT-code), using OOA 2-folding based on linear OA(2719, 732, F27, 10) (dual of [732, 713, 11]-code), using
- construction XX applied to C1 = C([727,7]), C2 = C([0,8]), C3 = C1 + C2 = C([0,7]), and C∩ = C1 ∩ C2 = C([727,8]) [i] based on
- linear OA(2717, 728, F27, 9) (dual of [728, 711, 10]-code), using the primitive BCH-code C(I) with length 728 = 272−1, defining interval I = {−1,0,…,7}, and designed minimum distance d ≥ |I|+1 = 10 [i]
- linear OA(2717, 728, F27, 9) (dual of [728, 711, 10]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 728 = 272−1, defining interval I = [0,8], and designed minimum distance d ≥ |I|+1 = 10 [i]
- linear OA(2719, 728, F27, 10) (dual of [728, 709, 11]-code), using the primitive BCH-code C(I) with length 728 = 272−1, defining interval I = {−1,0,…,8}, and designed minimum distance d ≥ |I|+1 = 11 [i]
- linear OA(2715, 728, F27, 8) (dual of [728, 713, 9]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 728 = 272−1, defining interval I = [0,7], and designed minimum distance d ≥ |I|+1 = 9 [i]
- linear OA(270, 2, F27, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(270, s, F27, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- linear OA(270, 2, F27, 0) (dual of [2, 2, 1]-code) (see above)
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
The following results depend on this result:
Result | This result only | Method | ||
---|---|---|---|---|
1 | Linear OOA(2724, 394, F27, 2, 10) (dual of [(394, 2), 764, 11]-NRT-code) | [i] | (u, u+v)-Construction for OOAs | |
2 | Linear OOA(2725, 404, F27, 2, 10) (dual of [(404, 2), 783, 11]-NRT-code) | [i] | ||
3 | Digital (9, 19, 366)-net over F27 | [i] | Embedding of OOA with Gilbert–Varšamov Bound |