MinT - Best Known (1, 32, s)-Nets in Base 16

Best Known (1, 32, s)-Nets in Base 16

(1, 32, 24)-Net over F₁₆ — Constructive and digital

Digital (1, 32, 24)-net over F₁₆, using

net from sequence [i] based on digital (1, 23)-sequence over F₁₆, using
- Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₁₆ with g(F) = 1 and N(F) ≥ 24, using
  - a function field by SÃ©mirat [i]

(1, 32, 25)-Net over F₁₆ — Digital

Digital (1, 32, 25)-net over F₁₆, using

net from sequence [i] based on digital (1, 24)-sequence over F₁₆, using
- Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₁₆ with g(F) = 1 and N(F) ≥ 25, using
  - sharp bound on the number of rational points on curves with genus 1 [i]

(1, 32, 33)-Net over F₁₆ — Upper bound on s (digital)

There is no digital (1, 32, 34)-net over F₁₆, because

1 times m-reduction [i] would yield digital (1, 31, 34)-net over F₁₆, but
- extracting embedded orthogonal array [i] would yield linear OA(16³¹, 34, F₁₆, 30) (dual of [34, 3, 31]-code), but
  - bound for almost-MDS-codes with dimension nÂ =Â 3 [i]

(1, 32, 35)-Net in Base 16 — Upper bound on s

There is no (1, 32, 36)-net in base 16, because

extracting embedded orthogonal array [i] would yield OA(16³², 36, S₁₆, 31), but
- the linear programming bound shows that MÂ â‰¥ 53764 613973 508277 227213 187974 219377 410048 / 119 > 16³² [i]