Best Known (66−31, 66, s)-Nets in Base 2
(66−31, 66, 26)-Net over F2 — Constructive and digital
Digital (35, 66, 26)-net over F2, using
- (u, u+v)-construction [i] based on
- digital (9, 24, 12)-net over F2, using
- net from sequence [i] based on digital (9, 11)-sequence over F2, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F2 with g(F) = 9 and N(F) ≥ 12, using
- Niederreiter–Xing sequence (Piršić implementation) with equidistant coordinate [i]
- net from sequence [i] based on digital (9, 11)-sequence over F2, using
- digital (11, 42, 14)-net over F2, using
- net from sequence [i] based on digital (11, 13)-sequence over F2, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F2 with g(F) = 11 and N(F) ≥ 14, using
- net from sequence [i] based on digital (11, 13)-sequence over F2, using
- digital (9, 24, 12)-net over F2, using
(66−31, 66, 29)-Net over F2 — Digital
Digital (35, 66, 29)-net over F2, using
- net from sequence [i] based on digital (35, 28)-sequence over F2, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F2 with g(F) = 35 and N(F) ≥ 29, using
(66−31, 66, 98)-Net in Base 2 — Upper bound on s
There is no (35, 66, 99)-net in base 2, because
- 1 times m-reduction [i] would yield (35, 65, 99)-net in base 2, but
- extracting embedded orthogonal array [i] would yield OA(265, 99, S2, 30), but
- the linear programming bound shows that M ≥ 3339 651673 727309 508069 294080 / 86 822723 > 265 [i]
- extracting embedded orthogonal array [i] would yield OA(265, 99, S2, 30), but