MinT - Best Known (65−34, 65, s)-Nets in Base 2

Best Known (65−34, 65, s)-Nets in Base 2

(65−34, 65, 21)-Net over F₂ — Constructive and digital

Digital (31, 65, 21)-net over F₂, using

t-expansion [i] based on digital (21, 65, 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]

(65−34, 65, 27)-Net over F₂ — Digital

Digital (31, 65, 27)-net over F₂, using

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

(65−34, 65, 70)-Net over F₂ — Upper bound on s (digital)

There is no digital (31, 65, 71)-net over F₂, because

2 times m-reduction [i] would yield digital (31, 63, 71)-net over F₂, but
- extracting embedded orthogonal array [i] would yield linear OA(2⁶³, 71, F₂, 32) (dual of [71, 8, 33]-code), but
  - residual code [i] would yield linear OA(2³¹, 38, F₂, 16) (dual of [38, 7, 17]-code), but
    - residual code [i] would yield linear OA(2¹⁵, 21, F₂, 8) (dual of [21, 6, 9]-code), but
      - residual code [i] would yield linear OA(2⁷, 12, F₂, 4) (dual of [12, 5, 5]-code), but
        bound by Fontaine and Peterson [i]

(65−34, 65, 72)-Net in Base 2 — Upper bound on s

There is no (31, 65, 73)-net in base 2, because

2 times m-reduction [i] would yield (31, 63, 73)-net in base 2, but
- extracting embedded orthogonal array [i] would yield OA(2⁶³, 73, S₂, 32), but
  - the linear programming bound shows that MÂ â‰¥ 12101 064112 353465 860096 / 1309 > 2⁶³ [i]