Best Known (218−142, 218, s)-Nets in Base 3
(218−142, 218, 51)-Net over F3 — Constructive and digital
Digital (76, 218, 51)-net over F3, using
- net from sequence [i] based on digital (76, 50)-sequence over F3, using
- base reduction for sequences [i] based on digital (13, 50)-sequence over F9, using
- s-reduction based on digital (13, 63)-sequence over F9, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F9 with g(F) = 13 and N(F) ≥ 64, using
- s-reduction based on digital (13, 63)-sequence over F9, using
- base reduction for sequences [i] based on digital (13, 50)-sequence over F9, using
(218−142, 218, 84)-Net over F3 — Digital
Digital (76, 218, 84)-net over F3, using
- t-expansion [i] based on digital (71, 218, 84)-net over F3, using
- net from sequence [i] based on digital (71, 83)-sequence over F3, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F3 with g(F) = 71 and N(F) ≥ 84, using
- net from sequence [i] based on digital (71, 83)-sequence over F3, using
(218−142, 218, 262)-Net over F3 — Upper bound on s (digital)
There is no digital (76, 218, 263)-net over F3, because
- 1 times m-reduction [i] would yield digital (76, 217, 263)-net over F3, but
- extracting embedded orthogonal array [i] would yield linear OA(3217, 263, F3, 141) (dual of [263, 46, 142]-code), but
- residual code [i] would yield OA(376, 121, S3, 47), but
- the linear programming bound shows that M ≥ 75 330660 326859 483146 711841 769969 417414 924993 897075 238905 711041 253960 166094 / 40 699162 450761 949016 181559 891872 548125 > 376 [i]
- residual code [i] would yield OA(376, 121, S3, 47), but
- extracting embedded orthogonal array [i] would yield linear OA(3217, 263, F3, 141) (dual of [263, 46, 142]-code), but
(218−142, 218, 298)-Net in Base 3 — Upper bound on s
There is no (76, 218, 299)-net in base 3, because
- 33 times m-reduction [i] would yield (76, 185, 299)-net in base 3, but
- extracting embedded orthogonal array [i] would yield OA(3185, 299, S3, 109), but
- 1 times code embedding in larger space [i] would yield OA(3186, 300, S3, 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 > 3186 [i]
- 1 times code embedding in larger space [i] would yield OA(3186, 300, S3, 109), but
- extracting embedded orthogonal array [i] would yield OA(3185, 299, S3, 109), but