Best Known (28−20, 28, s)-Nets in Base 3
(28−20, 28, 16)-Net over F3 — Constructive and digital
Digital (8, 28, 16)-net over F3, using
- t-expansion [i] based on digital (7, 28, 16)-net over F3, using
- net from sequence [i] based on digital (7, 15)-sequence over F3, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F3 with g(F) = 7 and N(F) ≥ 16, using
- net from sequence [i] based on digital (7, 15)-sequence over F3, using
(28−20, 28, 17)-Net over F3 — Digital
Digital (8, 28, 17)-net over F3, using
- net from sequence [i] based on digital (8, 16)-sequence over F3, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F3 with g(F) = 8 and N(F) ≥ 17, using
(28−20, 28, 30)-Net over F3 — Upper bound on s (digital)
There is no digital (8, 28, 31)-net over F3, because
- 2 times m-reduction [i] would yield digital (8, 26, 31)-net over F3, but
- extracting embedded orthogonal array [i] would yield linear OA(326, 31, F3, 18) (dual of [31, 5, 19]-code), but
- residual code [i] would yield linear OA(38, 12, F3, 6) (dual of [12, 4, 7]-code), but
- extracting embedded orthogonal array [i] would yield linear OA(326, 31, F3, 18) (dual of [31, 5, 19]-code), but
(28−20, 28, 33)-Net in Base 3 — Upper bound on s
There is no (8, 28, 34)-net in base 3, because
- extracting embedded orthogonal array [i] would yield OA(328, 34, S3, 20), but
- the linear programming bound shows that M ≥ 2447 816792 680827 / 91 > 328 [i]