The quality parameter for digital \((t,m,s)\)-nets (Q1873032): Difference between revisions

The author generalizes some techniques from real Diophantine approximation for studying the theory of continued fractions over finite fields. The author obtains new proofs and extensions of certain known results, and uses this theory to locate good candidates for \((t,m,s)\)-nets for \(s\geq 3\). Moreover, some computational results for binary \((t,m,3)\)-nets formed by the cyclic points \((1,g,g^2)\) are also given, where \(g\) is a polynomial for an irreducible polynomial \(f\) in \(\mathbb Z_2[x]\).