MinT - Best Known (2, 74, s)-Nets in Base 32

Best Known (2, 74, s)-Nets in Base 32

(2, 74, 44)-Net over F₃₂ — Constructive and digital

Digital (2, 74, 44)-net over F₃₂, using

t-expansion [i] based on digital (1, 74, 44)-net over F₃₂, using
- net from sequence [i] based on digital (1, 43)-sequence over F₃₂, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₃₂ with g(F) = 1 and N(F) ≥ 44, using
    - a function field by SÃ©mirat [i]

(2, 74, 53)-Net over F₃₂ — Digital

Digital (2, 74, 53)-net over F₃₂, using

net from sequence [i] based on digital (2, 52)-sequence over F₃₂, using
- Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₃₂ with g(F) = 2 and N(F) ≥ 53, using
  - sharp bound on the number of rational points on curves with genus 2 [i]

(2, 74, 98)-Net over F₃₂ — Upper bound on s (digital)

There is no digital (2, 74, 99)-net over F₃₂, because

8 times m-reduction [i] would yield digital (2, 66, 99)-net over F₃₂, but
- extracting embedded orthogonal array [i] would yield linear OA(32⁶⁶, 99, F₃₂, 64) (dual of [99, 33, 65]-code), but
  - residual code [i] would yield OA(32², 34, S₃₂, 2), but
    - bound for OAs with strength kÂ =Â 2 [i]
    - the Rao or (dual) Hamming bound shows that MÂ â‰¥ 1055 > 32² [i]

(2, 74, 187)-Net in Base 32 — Upper bound on s

There is no (2, 74, 188)-net in base 32, because

extracting embedded orthogonal array [i] would yield OA(32⁷⁴, 188, S₃₂, 72), but
- the linear programming bound shows that MÂ â‰¥ 1 910184 908484 901195 741321 970740 930848 045598 127613 948460 283615 832897 250518 774236 252509 166926 535357 133950 905439 387300 233679 470592 / 785 946775 103509 > 32⁷⁴ [i]