MinT - Best Known (233−165, 233, s)-Nets in Base 3

Best Known (233−165, 233, s)-Nets in Base 3

(233−165, 233, 48)-Net over F₃ — Constructive and digital

Digital (68, 233, 48)-net over F₃, using

t-expansion [i] based on digital (45, 233, 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]

(233−165, 233, 72)-Net over F₃ — Digital

Digital (68, 233, 72)-net over F₃, using

t-expansion [i] based on digital (67, 233, 72)-net over F₃, using
- net from sequence [i] based on digital (67, 71)-sequence over F₃, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₃ with g(F) = 67 and N(F) ≥ 72, using
    - algebraic function fields over â„¤₃ by Niederreiter/Xing [i]

(233−165, 233, 213)-Net over F₃ — Upper bound on s (digital)

There is no digital (68, 233, 214)-net over F₃, because

27 times m-reduction [i] would yield digital (68, 206, 214)-net over F₃, but
- extracting embedded orthogonal array [i] would yield linear OA(3²⁰⁶, 214, F₃, 138) (dual of [214, 8, 139]-code), but
  - residual code [i] would yield linear OA(3⁶⁸, 75, F₃, 46) (dual of [75, 7, 47]-code), but
    - 1 times truncation [i] would yield linear OA(3⁶⁷, 74, F₃, 45) (dual of [74, 7, 46]-code), but
      - residual code [i] would yield linear OA(3²², 28, F₃, 15) (dual of [28, 6, 16]-code), but
        â€œHHMâ€ bound on codes from Brouwerâ€™s database [i]

(233−165, 233, 217)-Net in Base 3 — Upper bound on s

There is no (68, 233, 218)-net in base 3, because

20 times m-reduction [i] would yield (68, 213, 218)-net in base 3, but
- extracting embedded orthogonal array [i] would yield OA(3²¹³, 218, S₃, 145), but
  - the (dual) Plotkin bound shows that MÂ â‰¥ 34 301433 818510 654479 997622 149056 072840 806381 240712 147713 459454 414705 167747 070180 824150 668119 248233 312163 / 73 > 3²¹³ [i]