Best Known (32−22, 32, s)-Nets in Base 3
(32−22, 32, 19)-Net over F3 — Constructive and digital
Digital (10, 32, 19)-net over F3, using
- t-expansion [i] based on digital (9, 32, 19)-net over F3, using
- net from sequence [i] based on digital (9, 18)-sequence over F3, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F3 with g(F) = 9 and N(F) ≥ 19, using
- net from sequence [i] based on digital (9, 18)-sequence over F3, using
(32−22, 32, 20)-Net over F3 — Digital
Digital (10, 32, 20)-net over F3, using
- net from sequence [i] based on digital (10, 19)-sequence over F3, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F3 with g(F) = 10 and N(F) ≥ 20, using
(32−22, 32, 36)-Net over F3 — Upper bound on s (digital)
There is no digital (10, 32, 37)-net over F3, because
- 1 times m-reduction [i] would yield digital (10, 31, 37)-net over F3, but
- extracting embedded orthogonal array [i] would yield linear OA(331, 37, F3, 21) (dual of [37, 6, 22]-code), but
- “Bou†bound on codes from Brouwer’s database [i]
- extracting embedded orthogonal array [i] would yield linear OA(331, 37, F3, 21) (dual of [37, 6, 22]-code), but
(32−22, 32, 41)-Net in Base 3 — Upper bound on s
There is no (10, 32, 42)-net in base 3, because
- extracting embedded orthogonal array [i] would yield OA(332, 42, S3, 22), but
- the linear programming bound shows that M ≥ 260 714381 510887 473177 / 124729 > 332 [i]