MinT - Information on Result #1119469

Information on Result #1119469

Linear OOA(3¹²³, 4194320, F₃, 5, 9) (dual of [(4194320, 5), 20971477, 10]-NRT-code), using generalized (u,Â u+v)-construction based on

linear OOA(3⁵, 20, F₃, 5, 3) (dual of [(20, 5), 95, 4]-NRT-code), using
- appending 2 arbitrary columns [i] based on linear OOA(3⁵, 20, F₃, 3, 3) (dual of [(20, 3), 55, 4]-NRT-code), using
  - appending kth column [i] based on linear OOA(3⁵, 20, F₃, 2, 3) (dual of [(20, 2), 35, 4]-NRT-code), using
    - OAs with strength 3, bÂ â‰ Â 2, and mÂ >Â 3 are always embeddable [i] based on linear OA(3⁵, 20, F₃, 3) (dual of [20, 15, 4]-code or 20-cap in PG(4,3)), using
      - doubling the cap [i] based on linear OA(3⁴, 10, F₃, 3) (dual of [10, 6, 4]-code or 10-cap in PG(3,3)), using
        ovoid in PG(3,Â 3) [i]
linear OOA(3²⁸, 2097150, F₃, 5, 4) (dual of [(2097150, 5), 10485722, 5]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(3²⁸, 2391484, F₃, 5, 4) (dual of [(2391484, 5), 11957392, 5]-NRT-code), using
  - OOA stacking with additional row [i] based on linear OOA(3²⁸, 2391485, F₃, 2, 4) (dual of [(2391485, 2), 4782942, 5]-NRT-code), using
    - extracting embedded OOA [i] based on digital (24, 28, 2391485)-net over F₃, using
      - nets constructed from net-embeddable BCH codes [i]
linear OOA(3⁹⁰, 2097150, F₃, 5, 9) (dual of [(2097150, 5), 10485660, 10]-NRT-code), using
- OOA 4-folding and stacking with additional row [i] based on linear OA(3⁹⁰, 8388601, F₃, 9) (dual of [8388601, 8388511, 10]-code), using
  - discarding factors / shortening the dual code based on linear OA(3⁹⁰, large, F₃, 9) (dual of [large, large−90, 10]-code), using
    - the primitive narrow-sense BCH-code C(I) with length 14348906Â = 3¹⁵âˆ’1, defining interval IÂ =Â [1,9], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 10 [i]

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.