MinT - Best Known (199−137, 199, s)-Nets in Base 3

Best Known (199−137, 199, s)-Nets in Base 3

(199−137, 199, 48)-Net over F₃ — Constructive and digital

Digital (62, 199, 48)-net over F₃, using

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

(199−137, 199, 64)-Net over F₃ — Digital

Digital (62, 199, 64)-net over F₃, using

t-expansion [i] based on digital (49, 199, 64)-net over F₃, using
- net from sequence [i] based on digital (49, 63)-sequence over F₃, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₃ with g(F) = 49 and N(F) ≥ 64, using
    - a curve from the manYPoints database [i]

(199−137, 199, 195)-Net over F₃ — Upper bound on s (digital)

There is no digital (62, 199, 196)-net over F₃, because

11 times m-reduction [i] would yield digital (62, 188, 196)-net over F₃, but
- extracting embedded orthogonal array [i] would yield linear OA(3¹⁸⁸, 196, F₃, 126) (dual of [196, 8, 127]-code), but
  - residual code [i] would yield linear OA(3⁶², 69, F₃, 42) (dual of [69, 7, 43]-code), but
    - â€œGurâ€ bound on codes from Brouwerâ€™s database [i]

(199−137, 199, 199)-Net in Base 3 — Upper bound on s

There is no (62, 199, 200)-net in base 3, because

4 times m-reduction [i] would yield (62, 195, 200)-net in base 3, but
- extracting embedded orthogonal array [i] would yield OA(3¹⁹⁵, 200, S₃, 133), but
  - the (dual) Plotkin bound shows that MÂ â‰¥ 88537 996291 958256 446260 440678 593208 943077 817551 131498 658191 653913 030830 300434 060998 128233 014667 / 67 > 3¹⁹⁵ [i]