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

Authors:
Rudolf Schürer;Wolfgang Ch. Schmid
Affiliations:
Department of Mathematics, University of Salzburg, Austria;Department of Mathematics, University of Salzburg, Austria
Venue:
Mathematics and Computers in Simulation
Year:
2010

Citing 7
Cited 0

Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
An equivalence between (T, M, S)-nets and strongly orthogonal hypercubes

Journal of Combinatorial Theory Series A
Extensions of Generalized Product Caps

Designs, Codes and Cryptography
A direct approach to linear programming bounds for codes and tms-nets

Designs, Codes and Cryptography
A Dual Plotkin Bound for (T,M,S) -Nets

IEEE Transactions on Information Theory
Low-Discrepancy Sequences and Global Function Fields with Many Rational Places

Finite Fields and Their Applications
Constructions of (t ,m,s)-nets and (t,s)-sequences

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.