Information on Result #1011846
Linear OOA(4114, 2796716, F4, 3, 11) (dual of [(2796716, 3), 8390034, 12]-NRT-code), using (u, u+v)-construction based on
- linear OOA(417, 515, F4, 3, 5) (dual of [(515, 3), 1528, 6]-NRT-code), using
- OOA 2-folding and stacking with additional row [i] based on linear OA(417, 1031, F4, 5) (dual of [1031, 1014, 6]-code), using
- construction X4 applied to Ce(4) ⊂ Ce(2) [i] based on
- linear OA(416, 1024, F4, 5) (dual of [1024, 1008, 6]-code), using an extension Ce(4) of the primitive narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [1,4], and designed minimum distance d ≥ |I|+1 = 5 [i]
- linear OA(411, 1024, F4, 3) (dual of [1024, 1013, 4]-code or 1024-cap in PG(10,4)), using an extension Ce(2) of the primitive narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [1,2], and designed minimum distance d ≥ |I|+1 = 3 [i]
- linear OA(46, 7, F4, 6) (dual of [7, 1, 7]-code or 7-arc in PG(5,4)), using
- dual of repetition code with length 7 [i]
- linear OA(41, 7, F4, 1) (dual of [7, 6, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(41, s, F4, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- construction X4 applied to Ce(4) ⊂ Ce(2) [i] based on
- OOA 2-folding and stacking with additional row [i] based on linear OA(417, 1031, F4, 5) (dual of [1031, 1014, 6]-code), using
- linear OOA(497, 2796201, F4, 3, 11) (dual of [(2796201, 3), 8388506, 12]-NRT-code), using
- OOA 3-folding [i] based on linear OA(497, large, F4, 11) (dual of [large, large−97, 12]-code), using
- the expurgated narrow-sense BCH-code C(I) with length 16777217 | 424−1, defining interval I = [0,5], and minimum distance d ≥ |{−5,−4,…,5}|+1 = 12 (BCH-bound) [i]
- OOA 3-folding [i] based on linear OA(497, large, F4, 11) (dual of [large, large−97, 12]-code), using
Mode: Constructive and linear.
Optimality
Show details for fixed k and m, k and s, k and t, m and s, m and t.
Other Results with Identical Parameters
None.
Depending Results
None.