✦ LIBER ✦

The Microstructure of (t, m, s)-Nets

✍ Scribed by Harald Niederreiter; Gottlieb Pirsic

Book ID: 102587892
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 128 KB
Volume: 17
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.2001.0596

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Updated tables of parameters of (T, M, S

Updated tables of parameters of (T, M, S)-nets

✍ Andrew T. Clayman; K. Mark Lawrence; Gary L. Mullen; Harald Niederreiter; N.J.A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

We present an updated survey of the known constructions and bounds for (t, m, s)nets as well as tables of upper and lower bounds on their parameters for various bases.

The distribution of the discrepancy of s

The distribution of the discrepancy of scrambled digital (t,m,s)-nets

✍ Hee Sun Hong; Fred J. Hickernell; Gang Wei 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A Dual Plotkin Bound for (T,M,S) -Nets

✍ Martin, W. J.; Visentin, T. I. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 230 KB

A combinatorial characterization of (t,m

A combinatorial characterization of (t,m,s)-nets in base b

✍ K. Mark Lawrence 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 956 KB

We consider ( t , rn, s)-nets in base b, which were introduced by Niederreiter in 1987. These nets are highly uniform point distributions in s-dimensional unit cubes and have applications in the theory of numerical integration and pseudorandom number generation. A central question in their study is

An Equivalence between (T, M, S)-Nets an

An Equivalence between (T, M, S)-Nets and Strongly Orthogonal Hypercubes

✍ Gary L. Mullen; Wolfgang Ch. Schmid 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 281 KB

It is well known that (t, m, s)-nets are useful in numerical analysis. While many of the best constructions of such nets arise from number theoretic or algebraic constructions, we will show in this paper that the existence of a (t, t+k, s)-net in base b is equivalent to the existence of a set of s s

Coding-theoretic constructions for (t,m,

Coding-theoretic constructions for (t,m,s)-nets and ordered orthogonal arrays

✍ Jürgen Bierbrauer; Yves Edel; Wolfgang Ch. Schmid 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract (__t__,__m__,__s__)‐nets are point sets in Euclidean __s__‐space satisfying certain uniformity conditions, for use in numerical integration. They can be equivalently described in terms of ordered orthogonal arrays, a class of finite geometrical structures generalizing orthogonal arrays.