MinT - Best Known (39, 39+156, s)-Nets in Base 4

Best Known (39, 39+156, s)-Nets in Base 4

(39, 39+156, 56)-Net over F₄ — Constructive and digital

Digital (39, 195, 56)-net over F₄, using

t-expansion [i] based on digital (33, 195, 56)-net over F₄, using
- net from sequence [i] based on digital (33, 55)-sequence over F₄, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₄ with g(F) = 33 and N(F) ≥ 56, using
    - F₅ from the tower of function fields by GarcÃa and Stichtenoth over F₄ [i]

(39, 39+156, 66)-Net over F₄ — Digital

Digital (39, 195, 66)-net over F₄, using

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

(39, 39+156, 165)-Net over F₄ — Upper bound on s (digital)

There is no digital (39, 195, 166)-net over F₄, because

36 times m-reduction [i] would yield digital (39, 159, 166)-net over F₄, but
- extracting embedded orthogonal array [i] would yield linear OA(4¹⁵⁹, 166, F₄, 120) (dual of [166, 7, 121]-code), but
  - residual code [i] would yield linear OA(4³⁹, 45, F₄, 30) (dual of [45, 6, 31]-code), but
    - â€œDaâ€ bound on codes from Brouwerâ€™s database [i]

(39, 39+156, 170)-Net in Base 4 — Upper bound on s

There is no (39, 195, 171)-net in base 4, because

28 times m-reduction [i] would yield (39, 167, 171)-net in base 4, but
- extracting embedded orthogonal array [i] would yield OA(4¹⁶⁷, 171, S₄, 128), but
  - the (dual) Plotkin bound shows that MÂ â‰¥ 2 239744 742177 804210 557442 280568 444278 121645 497234 649534 899989 100963 791871 180160 945380 877493 271607 115776 / 43 > 4¹⁶⁷ [i]