Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences (Q2566178)

This paper gives a nice survey on various constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences. Such point sets are very useful deterministic sample points for quasi-Monte Carlo methods. This survey can be considered an update of the earlier survey by the author in [\textit{H. Niederreiter, J. Spanier} (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 1998. Proceedings of a conference held at the Claremont Graduate Univ., Claremont, CA, USA, June 22--26, 1998. Springer, (Berlin), 70--85 (2000; Zbl 0924.00041)] . In particular, the following topics are included: duality theory for digital nets, links between digital nets and linear codes, connections to combinatorial designs, polynomial lattices, asymptotic theory of linear codes, scrambled nets and sequences. Finally, implementations and tables are briefly discussed.