MinT - Architecture and applications of the (t, m, s)-net and OOA database

Many 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 difficult to determine the best net available in a given setting. The MinT database developed by the authors is one of the most elaborate solutions to this problem. In this article we discuss some aspects of the theory that makes MinT work. We also provide a synopsis of the strongest bounds and existence results known today as determined by MinT.

[1]  Harald Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods 2006 , 2007 .

[2]  Wolfgang Ch. Schmid,et al.  Bounds for digital nets and sequences , 1997 .

[3]  Yves Edel.  Extensions of Generalized Product Caps , 2004, Des. Codes Cryptogr..

[4]  H. Niederreiter,et al.  Nets, ( t, s )-Sequences, and Algebraic Geometry , 1998 .

[5]  H. Niederreiter,et al.  Duality for digital nets and its applications , 2001 .

[6]  Gary L. Mullen,et al.  An Equivalence between (T, M, S)-Nets and Strongly Orthogonal Hypercubes , 1996, J. Comb. Theory, Ser. A.

[7]  Wolfgang Ch. Schmid,et al.  MinT: A Database for Optimal Net Parameters , 2006 .

[8]  H. Niederreiter,et al.  Low-Discrepancy Sequences and Global Function Fields with Many Rational Places , 1996 .

[9]  Douglas R Stinson,et al.  A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets , 1999, Canadian Mathematical Bulletin.

[10]  Y. Edel,et al.  Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays , 2002 .

[11]  Harald Niederreiter,et al.  Constructions of (t, m, s)-nets and (t, s)-sequences , 2005, Finite Fields Their Appl..

[12]  Harald Niederreiter,et al.  Updated tables of parameters of (T, M, S)‐nets , 1999 .

[13]  William J. Martin,et al.  Linear Programming Bounds for Ordered Orthogonal Arrays and (T, M, S)-nets , 2000 .

[14]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[15]  H. Niederreiter.  Point sets and sequences with small discrepancy , 1987 .

[16]  W. J. Martin,et al.  A Dual Plotkin Bound for $(T,M,S)$ -Nets , 2007, IEEE Transactions on Information Theory.

[17]  H. Niederreiter,et al.  A construction of low-discrepancy sequences using global function fields , 1995 .

[18]  Jürgen Bierbrauer,et al.  A direct approach to linear programming bounds for codes and tms-nets , 2007, Des. Codes Cryptogr..

[19]  Rudolf Schürer.  A New Lower Bound on the t-Parameter of (t, s)-Sequences , 2008 .

[20]  P. Hellekalek,et al.  Random and Quasi-Random Point Sets , 1998 .

[21]  K. Mark Lawrence,et al.  A combinatorial characterization of (t,m,s)-nets in baseb , 1996 .