MinT - Best Known (195−93, 195, s)-Nets in Base 2

Best Known (195−93, 195, s)-Nets in Base 2

(195−93, 195, 55)-Net over F₂ — Constructive and digital

Digital (102, 195, 55)-net over F₂, using

t-expansion [i] based on digital (100, 195, 55)-net over F₂, using
- net from sequence [i] based on digital (100, 54)-sequence over F₂, using
  - Niederreiterâ€“Xing sequence constructionÂ III based on the algebraic function field F/F₂ with g(F)Â =Â 69, N(F)Â =Â 48, 1 place with degree 2, and 6 places with degree 6 [i] based on function field F/F₂ with g(F) = 69 and N(F) ≥ 48, using an explicitly constructive algebraic function field [i]

(195−93, 195, 65)-Net over F₂ — Digital

Digital (102, 195, 65)-net over F₂, using

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

(195−93, 195, 219)-Net over F₂ — Upper bound on s (digital)

There is no digital (102, 195, 220)-net over F₂, because

1 times m-reduction [i] would yield digital (102, 194, 220)-net over F₂, but
- extracting embedded orthogonal array [i] would yield linear OA(2¹⁹⁴, 220, F₂, 92) (dual of [220, 26, 93]-code), but
  - adding a parity check bit [i] would yield linear OA(2¹⁹⁵, 221, F₂, 93) (dual of [221, 26, 94]-code), but
    - â€œBKâ€ bound on codes from Brouwerâ€™s database [i]

(195−93, 195, 272)-Net in Base 2 — Upper bound on s

There is no (102, 195, 273)-net in base 2, because

1 times m-reduction [i] would yield (102, 194, 273)-net in base 2, but
- the generalized Rao bound for nets shows that 2^mÂ â‰¥ 28563 711498 487614 039640 088186 087786 394049 741968 437674 315968 > 2¹⁹⁴ [i]