MinT: A Database for Optimal Net Parameters
An overwhelming variety of different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it a difficult task to determine the best net available in a given setting.
We present the web-based database system MinT for querying best known (t, m, s)-net and (t, s)-sequence parameters. This new system provides a number of hitherto unavailable services to the research community.
Unable to display preview. Download preview PDF.
- 2.R. C. Bose. On some connections between the design of experiments and information theory. Bull. Internat. Statist. Inst., 48:257–271, 1961.Google Scholar
- 5.K. M. Lawrence, A. Mahalanabis, G. L. Mullen, and W. Ch. Schmid. Construction of digital (t, m, s)-nets from linear codes. In S. D. Cohen and H. Niederreiter, editors, Finite Fields and Applications, volume 233 of Lect. Note Series of the London Math. Soc., pages 189–208, Cambridge, UK, 1996. Cambridge University Press.Google Scholar
- 6.G. L. Mullen, A. Mahalanabis, and H. Niederreiter. Tables of (t, m, s)-net and (t, s)-sequence parameters. In H. Niederreiter and P. J.-S. Shiue, editors, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, volume 106 of Lecture Notes Statistics, pages 58–86. Springer-Verlag, 1995.Google Scholar
- 9.H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods, volume 63 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1992.Google Scholar
- 10.H. Niederreiter. Constructions of (t, m, s)-nets. In H. Niederreiter and J. Spanier, editors, Monte Carlo and Quasi-Monte Carlo Methods 1998, pages 70–85. Springer-Verlag, 2000.Google Scholar
- 12.H. Niederreiter and C. P. Xing. The algebraic-geometry approach to low-discrepancy sequences. In H. Niederreiter et al., editors, Monte Carlo and Quasi-Monte Carlo Methods 1996, volume 127 of Lecture Notes Statistics, pages 139–160. Springer-Verlag, 1998.Google Scholar