Information on Result #1494928
Linear OOA(6455, 2459, F64, 3, 23) (dual of [(2459, 3), 7322, 24]-NRT-code), using OOA 2-folding based on linear OOA(6455, 4918, F64, 2, 23) (dual of [(4918, 2), 9781, 24]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(6455, 4919, F64, 2, 23) (dual of [(4919, 2), 9783, 24]-NRT-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(6455, 4919, F64, 23) (dual of [4919, 4864, 24]-code), using
- 811 step Varšamov–Edel lengthening with (ri) = (5, 0, 0, 1, 10 times 0, 1, 30 times 0, 1, 84 times 0, 1, 212 times 0, 1, 467 times 0) [i] based on linear OA(6445, 4098, F64, 23) (dual of [4098, 4053, 24]-code), using
- construction X applied to Ce(22) ⊂ Ce(21) [i] based on
- linear OA(6445, 4096, F64, 23) (dual of [4096, 4051, 24]-code), using an extension Ce(22) of the primitive narrow-sense BCH-code C(I) with length 4095 = 642−1, defining interval I = [1,22], and designed minimum distance d ≥ |I|+1 = 23 [i]
- linear OA(6443, 4096, F64, 22) (dual of [4096, 4053, 23]-code), using an extension Ce(21) of the primitive narrow-sense BCH-code C(I) with length 4095 = 642−1, defining interval I = [1,21], and designed minimum distance d ≥ |I|+1 = 22 [i]
- linear OA(640, 2, F64, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(640, s, F64, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to Ce(22) ⊂ Ce(21) [i] based on
- 811 step Varšamov–Edel lengthening with (ri) = (5, 0, 0, 1, 10 times 0, 1, 30 times 0, 1, 84 times 0, 1, 212 times 0, 1, 467 times 0) [i] based on linear OA(6445, 4098, F64, 23) (dual of [4098, 4053, 24]-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(6455, 4919, F64, 23) (dual of [4919, 4864, 24]-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.