MinT - Best Known (20, 137, s)-Nets in Base 4

Best Known (20, 137, s)-Nets in Base 4

(20, 137, 33)-Net over F₄ — Constructive and digital

Digital (20, 137, 33)-net over F₄, using

t-expansion [i] based on digital (15, 137, 33)-net over F₄, using
- net from sequence [i] based on digital (15, 32)-sequence over F₄, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₄ with g(F) = 15 and N(F) ≥ 33, using
    - an explicitly constructive algebraic function field [i]

(20, 137, 41)-Net over F₄ — Digital

Digital (20, 137, 41)-net over F₄, using

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

(20, 137, 87)-Net over F₄ — Upper bound on s (digital)

There is no digital (20, 137, 88)-net over F₄, because

53 times m-reduction [i] would yield digital (20, 84, 88)-net over F₄, but
- extracting embedded orthogonal array [i] would yield linear OA(4⁸⁴, 88, F₄, 64) (dual of [88, 4, 65]-code), but
  - Griesmer bound [i]

(20, 137, 88)-Net in Base 4 — Upper bound on s

There is no (20, 137, 89)-net in base 4, because

58 times m-reduction [i] would yield (20, 79, 89)-net in base 4, but
- extracting embedded orthogonal array [i] would yield OA(4⁷⁹, 89, S₄, 59), but
  - the linear programming bound shows that MÂ â‰¥ 61920 901370 435694 838453 718992 523478 976782 549980 807168 / 142375 > 4⁷⁹ [i]