MinT - Best Known (132, 132+115, s)-Nets in Base 2

Best Known (132, 132+115, s)-Nets in Base 2

(132, 132+115, 63)-Net over F₂ — Constructive and digital

Digital (132, 247, 63)-net over F₂, using

(u,Â u+v)-construction [i] based on
1. digital (21, 78, 21)-net over F₂, using
  - net from sequence [i] based on digital (21, 20)-sequence over F₂, using
    - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₂ with g(F) = 21 and N(F) ≥ 21, using
      - an explicitly constructive algebraic function field [i]
2. digital (54, 169, 42)-net over F₂, using
  - net from sequence [i] based on digital (54, 41)-sequence over F₂, using
    - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₂ with g(F) = 54 and N(F) ≥ 42, using
      - an explicitly constructive algebraic function field [i]

(132, 132+115, 81)-Net over F₂ — Digital

Digital (132, 247, 81)-net over F₂, using

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

(132, 132+115, 296)-Net in Base 2 — Upper bound on s

There is no (132, 247, 297)-net in base 2, because

7 times m-reduction [i] would yield (132, 240, 297)-net in base 2, but
- extracting embedded orthogonal array [i] would yield OA(2²⁴⁰, 297, S₂, 108), but
  - the linear programming bound shows that MÂ â‰¥ 28020 398795 768772 015654 276848 365160 205592 563190 101250 876110 646415 347830 039205 258520 634937 311232 / 15527 302685 925212 739375 > 2²⁴⁰ [i]