Information on Result #1529196
Linear OOA(3211, 70004, F3, 3, 27) (dual of [(70004, 3), 209801, 28]-NRT-code), using embedding of OOA with Gilbert–Varšamov bound based on linear OOA(3211, 70004, F3, 2, 27) (dual of [(70004, 2), 139797, 28]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(3211, 88602, F3, 2, 27) (dual of [(88602, 2), 176993, 28]-NRT-code), using
- OOA 2-folding [i] based on linear OA(3211, 177204, F3, 27) (dual of [177204, 176993, 28]-code), using
- construction X applied to C([0,13]) ⊂ C([0,10]) [i] based on
- linear OA(3199, 177148, F3, 27) (dual of [177148, 176949, 28]-code), using the expurgated narrow-sense BCH-code C(I) with length 177148 | 322−1, defining interval I = [0,13], and minimum distance d ≥ |{−13,−12,…,13}|+1 = 28 (BCH-bound) [i]
- linear OA(3155, 177148, F3, 21) (dual of [177148, 176993, 22]-code), using the expurgated narrow-sense BCH-code C(I) with length 177148 | 322−1, defining interval I = [0,10], and minimum distance d ≥ |{−10,−9,…,10}|+1 = 22 (BCH-bound) [i]
- linear OA(312, 56, F3, 5) (dual of [56, 44, 6]-code), using
- (u, u+v)-construction [i] based on
- linear OA(34, 28, F3, 2) (dual of [28, 24, 3]-code), using
- discarding factors / shortening the dual code based on linear OA(34, 40, F3, 2) (dual of [40, 36, 3]-code), using
- Hamming code H(4,3) [i]
- discarding factors / shortening the dual code based on linear OA(34, 40, F3, 2) (dual of [40, 36, 3]-code), using
- linear OA(38, 28, F3, 5) (dual of [28, 20, 6]-code), using
- dual code (with bound on d by construction Y1) [i] based on
- linear OA(34, 28, F3, 2) (dual of [28, 24, 3]-code), using
- (u, u+v)-construction [i] based on
- construction X applied to C([0,13]) ⊂ C([0,10]) [i] based on
- OOA 2-folding [i] based on linear OA(3211, 177204, F3, 27) (dual of [177204, 176993, 28]-code), using
Mode: 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.