Information on Result #1838827
OOA(12872, 16643, S128, 4, 25), using (u, u+v)-construction based on
- OOA(12816, 259, S128, 4, 12), using
- extracting embedded OOA [i] based on (4, 16, 259)-net in base 128, using
- base change [i] based on digital (2, 14, 259)-net over F256, using
- net from sequence [i] based on digital (2, 258)-sequence over F256, using
- base change [i] based on digital (2, 14, 259)-net over F256, using
- extracting embedded OOA [i] based on (4, 16, 259)-net in base 128, using
- OOA(12856, 16384, S128, 4, 25), using
- OOA 4-folding [i] based on OA(12856, 65536, S128, 25), using
- discarding factors based on OA(12856, 65538, S128, 25), using
- discarding parts of the base [i] based on linear OA(25649, 65538, F256, 25) (dual of [65538, 65489, 26]-code), using
- construction X applied to Ce(24) ⊂ Ce(23) [i] based on
- linear OA(25649, 65536, F256, 25) (dual of [65536, 65487, 26]-code), using an extension Ce(24) of the primitive narrow-sense BCH-code C(I) with length 65535 = 2562−1, defining interval I = [1,24], and designed minimum distance d ≥ |I|+1 = 25 [i]
- linear OA(25647, 65536, F256, 24) (dual of [65536, 65489, 25]-code), using an extension Ce(23) of the primitive narrow-sense BCH-code C(I) with length 65535 = 2562−1, defining interval I = [1,23], and designed minimum distance d ≥ |I|+1 = 24 [i]
- linear OA(2560, 2, F256, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(2560, s, F256, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to Ce(24) ⊂ Ce(23) [i] based on
- discarding parts of the base [i] based on linear OA(25649, 65538, F256, 25) (dual of [65538, 65489, 26]-code), using
- discarding factors based on OA(12856, 65538, S128, 25), using
- OOA 4-folding [i] based on OA(12856, 65536, S128, 25), using
Mode: Constructive.
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.