MinT - Best Known (220−148, 220, s)-Nets in Base 3

Best Known (220−148, 220, s)-Nets in Base 3

(220−148, 220, 48)-Net over F₃ — Constructive and digital

Digital (72, 220, 48)-net over F₃, using

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

(220−148, 220, 84)-Net over F₃ — Digital

Digital (72, 220, 84)-net over F₃, using

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

(220−148, 220, 226)-Net over F₃ — Upper bound on s (digital)

There is no digital (72, 220, 227)-net over F₃, because

1 times m-reduction [i] would yield digital (72, 219, 227)-net over F₃, but
- extracting embedded orthogonal array [i] would yield linear OA(3²¹⁹, 227, F₃, 147) (dual of [227, 8, 148]-code), but
  - residual code [i] would yield linear OA(3⁷², 79, F₃, 49) (dual of [79, 7, 50]-code), but
    - 1 times truncation [i] would yield linear OA(3⁷¹, 78, F₃, 48) (dual of [78, 7, 49]-code), but
      - residual code [i] would yield linear OA(3²³, 29, F₃, 16) (dual of [29, 6, 17]-code), but
        1 times truncation [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]

(220−148, 220, 294)-Net in Base 3 — Upper bound on s

There is no (72, 220, 295)-net in base 3, because

39 times m-reduction [i] would yield (72, 181, 295)-net in base 3, but
- extracting embedded orthogonal array [i] would yield OA(3¹⁸¹, 295, S₃, 109), but
  - 5 times code embedding in larger space [i] would yield OA(3¹⁸⁶, 300, S₃, 109), but
    - the linear programming bound shows that MÂ â‰¥ 744 646766 850603 526568 601268 797422 932026 535817 992617 489413 629925 481692 835741 945421 210090 969950 381274 252816 504020 353660 158683 457200 925516 493661 440389 831805 338854 508258 811020 990136 433923 762970 235494 388055 889637 880458 633459 997426 817105 857222 614437 226587 / 10512 885684 310613 723066 595609 767913 116130 406095 478720 857818 594175 294259 025889 504412 156455 324830 169263 105843 888569 812652 562285 873819 443701 107860 316189 843301 339995 > 3¹⁸⁶ [i]