MinT - Best Known (36, 36+41, s)-Nets in Base 2

Best Known (36, 36+41, s)-Nets in Base 2

(36, 36+41, 24)-Net over F₂ — Constructive and digital

Digital (36, 77, 24)-net over F₂, using

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

(36, 36+41, 30)-Net over F₂ — Digital

Digital (36, 77, 30)-net over F₂, using

net from sequence [i] based on digital (36, 29)-sequence over F₂, using
- Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₂ with g(F) = 36 and N(F) ≥ 30, using
  - Drinfeld modules of rank 1 [i]

(36, 36+41, 80)-Net over F₂ — Upper bound on s (digital)

There is no digital (36, 77, 81)-net over F₂, because

1 times m-reduction [i] would yield digital (36, 76, 81)-net over F₂, but
- extracting embedded orthogonal array [i] would yield linear OA(2⁷⁶, 81, F₂, 40) (dual of [81, 5, 41]-code), but
  - Griesmer bound [i]

(36, 36+41, 83)-Net in Base 2 — Upper bound on s

There is no (36, 77, 84)-net in base 2, because

3 times m-reduction [i] would yield (36, 74, 84)-net in base 2, but
- extracting embedded orthogonal array [i] would yield OA(2⁷⁴, 84, S₂, 38), but
  - the linear programming bound shows that MÂ â‰¥ 604462 909807 314587 353088 / 25 > 2⁷⁴ [i]