Information on Result #1014371
Linear OOA(872, 699084, F8, 3, 11) (dual of [(699084, 3), 2097180, 12]-NRT-code), using (u, u+v)-construction based on
- linear OOA(87, 28, F8, 3, 5) (dual of [(28, 3), 77, 6]-NRT-code), using
- OOA 2-folding and stacking with additional row [i] based on linear OA(87, 57, F8, 5) (dual of [57, 50, 6]-code), using
- linear OOA(865, 699056, F8, 3, 11) (dual of [(699056, 3), 2097103, 12]-NRT-code), using
- OOA 3-folding [i] based on linear OA(865, 2097168, F8, 11) (dual of [2097168, 2097103, 12]-code), using
- construction X4 applied to Ce(10) ⊂ Ce(8) [i] based on
- linear OA(864, 2097152, F8, 11) (dual of [2097152, 2097088, 12]-code), using an extension Ce(10) of the primitive narrow-sense BCH-code C(I) with length 2097151 = 87−1, defining interval I = [1,10], and designed minimum distance d ≥ |I|+1 = 11 [i]
- linear OA(850, 2097152, F8, 9) (dual of [2097152, 2097102, 10]-code), using an extension Ce(8) of the primitive narrow-sense BCH-code C(I) with length 2097151 = 87−1, defining interval I = [1,8], and designed minimum distance d ≥ |I|+1 = 9 [i]
- linear OA(815, 16, F8, 15) (dual of [16, 1, 16]-code or 16-arc in PG(14,8)), using
- dual of repetition code with length 16 [i]
- linear OA(81, 16, F8, 1) (dual of [16, 15, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(81, 511, F8, 1) (dual of [511, 510, 2]-code), using
- the primitive expurgated narrow-sense BCH-code C(I) with length 511 = 83−1, defining interval I = [0,0], and designed minimum distance d ≥ |I|+1 = 2 [i]
- discarding factors / shortening the dual code based on linear OA(81, 511, F8, 1) (dual of [511, 510, 2]-code), using
- construction X4 applied to Ce(10) ⊂ Ce(8) [i] based on
- OOA 3-folding [i] based on linear OA(865, 2097168, F8, 11) (dual of [2097168, 2097103, 12]-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.