Best Known (3, ∞, s)-Nets in Base 32
(3, ∞, 64)-Net over F32 — Constructive and digital
Digital (3, m, 64)-net over F32 for arbitrarily large m, using
- net from sequence [i] based on digital (3, 63)-sequence over F32, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F32 with g(F) = 3 and N(F) ≥ 64, using
(3, ∞, 131)-Net over F32 — Upper bound on s (digital)
There is no digital (3, m, 132)-net over F32 for arbitrarily large m, because
- m-reduction [i] would yield digital (3, 99, 132)-net over F32, but
- extracting embedded orthogonal array [i] would yield linear OA(3299, 132, F32, 96) (dual of [132, 33, 97]-code), but
- residual code [i] would yield OA(323, 35, S32, 3), but
- 1 times truncation [i] would yield OA(322, 34, S32, 2), but
- bound for OAs with strength k = 2 [i]
- the Rao or (dual) Hamming bound shows that M ≥ 1055 > 322 [i]
- 1 times truncation [i] would yield OA(322, 34, S32, 2), but
- residual code [i] would yield OA(323, 35, S32, 3), but
- extracting embedded orthogonal array [i] would yield linear OA(3299, 132, F32, 96) (dual of [132, 33, 97]-code), but
(3, ∞, 132)-Net in Base 32 — Upper bound on s
There is no (3, m, 133)-net in base 32 for arbitrarily large m, because
- m-reduction [i] would yield (3, 131, 133)-net in base 32, but
- extracting embedded OOA [i] would yield OA(32131, 133, S32, 128), but
- the (dual) Plotkin bound for OOAs shows that M ≥ 23 920328 665319 054867 909425 788093 943381 456209 876083 329888 835036 868243 751788 655030 496164 120160 199620 164471 448192 017206 646201 063596 209604 856372 278912 979945 202323 302617 838309 945901 490499 445045 874005 114880 / 129 > 32131 [i]
- extracting embedded OOA [i] would yield OA(32131, 133, S32, 128), but