MinT - Best Known (184−92, 184, s)-Nets in Base 2

Best Known (184−92, 184, s)-Nets in Base 2

(184−92, 184, 53)-Net over F₂ — Constructive and digital

Digital (92, 184, 53)-net over F₂, using

t-expansion [i] based on digital (90, 184, 53)-net over F₂, using
- net from sequence [i] based on digital (90, 52)-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 4 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]

(184−92, 184, 60)-Net over F₂ — Digital

Digital (92, 184, 60)-net over F₂, using

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

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

There is no digital (92, 184, 196)-net over F₂, because

extracting embedded orthogonal array [i] would yield linear OA(2¹⁸⁴, 196, F₂, 92) (dual of [196, 12, 93]-code), but
- residual code [i] would yield linear OA(2⁹², 103, F₂, 46) (dual of [103, 11, 47]-code), but
  - adding a parity check bit [i] would yield linear OA(2⁹³, 104, F₂, 47) (dual of [104, 11, 48]-code), but
    - â€œJaâ€ bound on codes from Brouwerâ€™s database [i]

(184−92, 184, 226)-Net in Base 2 — Upper bound on s

There is no (92, 184, 227)-net in base 2, because

the generalized Rao bound for nets shows that 2^mÂ â‰¥ 28 498587 518876 049611 241950 972301 614716 493156 335701 539568 > 2¹⁸⁴ [i]