Best Known (187−85, 187, s)-Nets in Base 2
(187−85, 187, 55)-Net over F2 — Constructive and digital
Digital (102, 187, 55)-net over F2, using
- t-expansion [i] based on digital (100, 187, 55)-net over F2, using
- net from sequence [i] based on digital (100, 54)-sequence over F2, using
- Niederreiter–Xing sequence construction III based on the algebraic function field F/F2 with g(F) = 69, N(F) = 48, 1 place with degree 2, and 6 places with degree 6 [i] based on function field F/F2 with g(F) = 69 and N(F) ≥ 48, using an explicitly constructive algebraic function field [i]
- net from sequence [i] based on digital (100, 54)-sequence over F2, using
(187−85, 187, 65)-Net over F2 — Digital
Digital (102, 187, 65)-net over F2, using
- t-expansion [i] based on digital (95, 187, 65)-net over F2, using
- net from sequence [i] based on digital (95, 64)-sequence over F2, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F2 with g(F) = 95 and N(F) ≥ 65, using
- net from sequence [i] based on digital (95, 64)-sequence over F2, using
(187−85, 187, 288)-Net in Base 2 — Upper bound on s
There is no (102, 187, 289)-net in base 2, because
- 1 times m-reduction [i] would yield (102, 186, 289)-net in base 2, but
- extracting embedded orthogonal array [i] would yield OA(2186, 289, S2, 84), but
- 10 times code embedding in larger space [i] would yield OA(2196, 299, S2, 84), but
- adding a parity check bit [i] would yield OA(2197, 300, S2, 85), but
- the linear programming bound shows that M ≥ 333445 596634 842101 957662 761369 966680 970228 955880 375209 681209 067512 159971 176505 925710 036206 046927 475988 200870 117376 / 1 055603 696799 631985 996897 950925 994087 362055 971326 408581 > 2197 [i]
- adding a parity check bit [i] would yield OA(2197, 300, S2, 85), but
- 10 times code embedding in larger space [i] would yield OA(2196, 299, S2, 84), but
- extracting embedded orthogonal array [i] would yield OA(2186, 289, S2, 84), but