MinT - Best Known (28, 28+30, s)-Nets in Base 2

Best Known (28, 28+30, s)-Nets in Base 2

(28, 28+30, 21)-Net over F₂ — Constructive and digital

Digital (28, 58, 21)-net over F₂, using

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

(28, 28+30, 25)-Net over F₂ — Digital

Digital (28, 58, 25)-net over F₂, using

net from sequence [i] based on digital (28, 24)-sequence over F₂, using
- Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₂ with g(F) = 28 and N(F) ≥ 25, using
  - a curve from the manYPoints database [i]

(28, 28+30, 65)-Net over F₂ — Upper bound on s (digital)

There is no digital (28, 58, 66)-net over F₂, because

2 times m-reduction [i] would yield digital (28, 56, 66)-net over F₂, but
- extracting embedded orthogonal array [i] would yield linear OA(2⁵⁶, 66, F₂, 28) (dual of [66, 10, 29]-code), but
  - adding a parity check bit [i] would yield linear OA(2⁵⁷, 67, F₂, 29) (dual of [67, 10, 30]-code), but
    - â€œJaâ€ bound on codes from Brouwerâ€™s database [i]

(28, 28+30, 66)-Net in Base 2 — Upper bound on s

There is no (28, 58, 67)-net in base 2, because

extracting embedded orthogonal array [i] would yield OA(2⁵⁸, 67, S₂, 30), but
- the linear programming bound shows that MÂ â‰¥ 10 376293 541461 622784 / 35 > 2⁵⁸ [i]