Information on Result #899959
Linear OOA(25102, 195344, F25, 2, 23) (dual of [(195344, 2), 390586, 24]-NRT-code), using (u, u+v)-construction based on
- linear OOA(2512, 27, F25, 2, 11) (dual of [(27, 2), 42, 12]-NRT-code), using
- extracting embedded OOA [i] based on digital (1, 12, 27)-net over F25, using
- net from sequence [i] based on digital (1, 26)-sequence over F25, using
- extracting embedded OOA [i] based on digital (1, 12, 27)-net over F25, using
- linear OOA(2590, 195317, F25, 2, 23) (dual of [(195317, 2), 390544, 24]-NRT-code), using
- OOA 2-folding [i] based on linear OA(2590, 390634, F25, 23) (dual of [390634, 390544, 24]-code), using
- discarding factors / shortening the dual code based on linear OA(2590, 390635, F25, 23) (dual of [390635, 390545, 24]-code), using
- construction X applied to C([0,11]) ⊂ C([0,10]) [i] based on
- linear OA(2589, 390626, F25, 23) (dual of [390626, 390537, 24]-code), using the expurgated narrow-sense BCH-code C(I) with length 390626 | 258−1, defining interval I = [0,11], and minimum distance d ≥ |{−11,−10,…,11}|+1 = 24 (BCH-bound) [i]
- linear OA(2581, 390626, F25, 21) (dual of [390626, 390545, 22]-code), using the expurgated narrow-sense BCH-code C(I) with length 390626 | 258−1, defining interval I = [0,10], and minimum distance d ≥ |{−10,−9,…,10}|+1 = 22 (BCH-bound) [i]
- linear OA(251, 9, F25, 1) (dual of [9, 8, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(251, s, F25, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- construction X applied to C([0,11]) ⊂ C([0,10]) [i] based on
- discarding factors / shortening the dual code based on linear OA(2590, 390635, F25, 23) (dual of [390635, 390545, 24]-code), using
- OOA 2-folding [i] based on linear OA(2590, 390634, F25, 23) (dual of [390634, 390544, 24]-code), using
Mode: Constructive and 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.