MinT - Best Known (35, 35+36, s)-Nets in Base 64

Best Known (35, 35+36, s)-Nets in Base 64

(35, 35+36, 513)-Net over F₆₄ — Constructive and digital

Digital (35, 71, 513)-net over F₆₄, using

t-expansion [i] based on digital (28, 71, 513)-net over F₆₄, using
- net from sequence [i] based on digital (28, 512)-sequence over F₆₄, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₆₄ with g(F) = 28 and N(F) ≥ 513, using
    - the Hermitian function field over F₆₄ [i]

(35, 35+36, 1366)-Net over F₆₄ — Digital

Digital (35, 71, 1366)-net over F₆₄, using

embedding of OOA with Gilbertâ€“VarÅ¡amov bound [i] based on linear OOA(64⁷¹, 1366, F₆₄, 3, 36) (dual of [(1366, 3), 4027, 37]-NRT-code), using
- OOA 3-folding [i] based on linear OA(64⁷¹, 4098, F₆₄, 36) (dual of [4098, 4027, 37]-code), using
  - constructionÂ X applied to C_e(35) âŠ‚ C_e(34) [i] based on
    1. linear OA(64⁷¹, 4096, F₆₄, 36) (dual of [4096, 4025, 37]-code), using an extension C_e(35) of the primitive narrow-sense BCH-code C(I) with length 4095Â = 64²âˆ’1, defining interval IÂ =Â [1,35], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 36 [i]
    2. linear OA(64⁶⁹, 4096, F₆₄, 35) (dual of [4096, 4027, 36]-code), using an extension C_e(34) of the primitive narrow-sense BCH-code C(I) with length 4095Â = 64²âˆ’1, defining interval IÂ =Â [1,34], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 35 [i]
    3. linear OA(64⁰, 2, F₆₄, 0) (dual of [2, 2, 1]-code), using
      - discarding factors / shortening the dual code based on linear OA(64⁰, s, F₆₄, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
        OA with only one run / dual of code without redundancy [i]

(35, 35+36, 1596480)-Net in Base 64 — Upper bound on s

There is no (35, 71, 1596481)-net in base 64, because

the generalized Rao bound for nets shows that 64^mÂ â‰¥ 173 292380 235030 994874 756173 325088 194505 958953 307021 020556 879763 407546 976573 134235 708638 785974 843985 386272 530698 558344 735360 101472 > 64⁷¹ [i]