Information on Result #1650567
Linear OOA(3228, 23634, F3, 5, 33) (dual of [(23634, 5), 117942, 34]-NRT-code), using embedding of OOA with Gilbert–Varšamov bound based on linear OOA(3228, 23634, F3, 2, 33) (dual of [(23634, 2), 47040, 34]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(3228, 29543, F3, 2, 33) (dual of [(29543, 2), 58858, 34]-NRT-code), using
- OOA 2-folding [i] based on linear OA(3228, 59086, F3, 33) (dual of [59086, 58858, 34]-code), using
- 1 times truncation [i] based on linear OA(3229, 59087, F3, 34) (dual of [59087, 58858, 35]-code), using
- construction X applied to Ce(33) ⊂ Ce(28) [i] based on
- linear OA(3221, 59049, F3, 34) (dual of [59049, 58828, 35]-code), using an extension Ce(33) of the primitive narrow-sense BCH-code C(I) with length 59048 = 310−1, defining interval I = [1,33], and designed minimum distance d ≥ |I|+1 = 34 [i]
- linear OA(3191, 59049, F3, 29) (dual of [59049, 58858, 30]-code), using an extension Ce(28) of the primitive narrow-sense BCH-code C(I) with length 59048 = 310−1, defining interval I = [1,28], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(38, 38, F3, 4) (dual of [38, 30, 5]-code), using
- discarding factors / shortening the dual code based on linear OA(38, 41, F3, 4) (dual of [41, 33, 5]-code), using
- the narrow-sense BCH-code C(I) with length 41 | 38−1, defining interval I = [1,1], and minimum distance d ≥ |{−3,−1,1,3}|+1 = 5 (BCH-bound) [i]
- discarding factors / shortening the dual code based on linear OA(38, 41, F3, 4) (dual of [41, 33, 5]-code), using
- construction X applied to Ce(33) ⊂ Ce(28) [i] based on
- 1 times truncation [i] based on linear OA(3229, 59087, F3, 34) (dual of [59087, 58858, 35]-code), using
- OOA 2-folding [i] based on linear OA(3228, 59086, F3, 33) (dual of [59086, 58858, 34]-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.