The quality parameter for digital (t,m,s)-nets Original Research Article

The theory of continued fractions over finite fields has been used to identify good digital (t,m,2)-nets. In this article, we generalize some techniques from real diophantine approximation which can be helpful for locating good candidates for (t,m,s)-nets for s≥3. We include some computational results for binary (t,m,3)-nets.