Information on Result #1485186
Linear OOA(580, 1794, F5, 3, 18) (dual of [(1794, 3), 5302, 19]-NRT-code), using OOA 2-folding based on linear OOA(580, 3588, F5, 2, 18) (dual of [(3588, 2), 7096, 19]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(580, 3589, F5, 2, 18) (dual of [(3589, 2), 7098, 19]-NRT-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(580, 3589, F5, 18) (dual of [3589, 3509, 19]-code), using
- 445 step Varšamov–Edel lengthening with (ri) = (2, 0, 1, 5 times 0, 1, 13 times 0, 1, 30 times 0, 1, 63 times 0, 1, 122 times 0, 1, 204 times 0) [i] based on linear OA(572, 3136, F5, 18) (dual of [3136, 3064, 19]-code), using
- construction X applied to Ce(17) ⊂ Ce(15) [i] based on
- linear OA(571, 3125, F5, 18) (dual of [3125, 3054, 19]-code), using an extension Ce(17) of the primitive narrow-sense BCH-code C(I) with length 3124 = 55−1, defining interval I = [1,17], and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(561, 3125, F5, 16) (dual of [3125, 3064, 17]-code), using an extension Ce(15) of the primitive narrow-sense BCH-code C(I) with length 3124 = 55−1, defining interval I = [1,15], and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(51, 11, F5, 1) (dual of [11, 10, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(51, s, F5, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- construction X applied to Ce(17) ⊂ Ce(15) [i] based on
- 445 step Varšamov–Edel lengthening with (ri) = (2, 0, 1, 5 times 0, 1, 13 times 0, 1, 30 times 0, 1, 63 times 0, 1, 122 times 0, 1, 204 times 0) [i] based on linear OA(572, 3136, F5, 18) (dual of [3136, 3064, 19]-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(580, 3589, F5, 18) (dual of [3589, 3509, 19]-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.