MinT - Best Known (26, 38, s)-Nets in Base 4

Best Known (26, 38, s)-Nets in Base 4

(26, 38, 195)-Net over F₄ — Constructive and digital

Digital (26, 38, 195)-net over F₄, using

1 times m-reduction [i] based on digital (26, 39, 195)-net over F₄, using
- trace code for nets [i] based on digital (0, 13, 65)-net over F₆₄, using
  - net from sequence [i] based on digital (0, 64)-sequence over F₆₄, using
    - generalized Faure sequence [i]
    - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₆₄ with g(F) = 0 and N(F) ≥ 65, using
      - the rational function field F₆₄(x) [i]
    - Niederreiter sequence [i]

(26, 38, 248)-Net over F₄ — Digital

Digital (26, 38, 248)-net over F₄, using

embedding of OOA with Gilbertâ€“VarÅ¡amov bound [i] based on linear OA(4³⁸, 248, F₄, 12) (dual of [248, 210, 13]-code), using
- discarding factors / shortening the dual code based on linear OA(4³⁸, 265, F₄, 12) (dual of [265, 227, 13]-code), using
  - constructionÂ X applied to C_e(12) âŠ‚ C_e(9) [i] based on
    1. linear OA(4³⁷, 256, F₄, 13) (dual of [256, 219, 14]-code), using an extension C_e(12) of the primitive narrow-sense BCH-code C(I) with length 255Â = 4⁴âˆ’1, defining interval IÂ =Â [1,12], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 13 [i]
    2. linear OA(4²⁹, 256, F₄, 10) (dual of [256, 227, 11]-code), using an extension C_e(9) of the primitive narrow-sense BCH-code C(I) with length 255Â = 4⁴âˆ’1, defining interval IÂ =Â [1,9], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 10 [i]
    3. linear OA(4¹, 9, F₄, 1) (dual of [9, 8, 2]-code), using
      - discarding factors / shortening the dual code based on linear OA(4¹, s, F₄, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s, using
        parity-check code [i]

(26, 38, 6484)-Net in Base 4 — Upper bound on s

There is no (26, 38, 6485)-net in base 4, because

the generalized Rao bound for nets shows that 4^mÂ â‰¥ 75624 401376 136603 359352 > 4³⁸ [i]