(t, m, s)-nets are a powerful tool for the generation of low-discrepancy point sets. We find nets with improved parameters using a coding-theoretic approach, starting with an orthogonal array (dual of a linear code) and embedding it in a net. The innovation of our approach is that propagation rules for OOAs are applied halfway through the embedding process. To this end many propagation rules have been generalized from the setting of orthogonal arrays to OOAs. According to MINT [1], the online database of (t, m, s)-net parameters at mint.sbg.ac.at, more than 100 nets with previously unknown parameters have been found using this method. Copyright line will be provided by the publisher 1 Definitions and Earlier Results (t, m, s)-nets [2] (see ...
Summary. Many experiments in computer graphics imply that the average quality of quasi-Monte Carlo i...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...
AbstractIn an article of A. B. Owen (1998, J. Complexity14, 466–489) the question about the distribu...
Summary. Starting from coding-theoretic constructions, we build digital nets with good figures of me...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
We establish a link between the theory of error-correcting codes and the theory of (t,m, s)-nets. Th...
We construct families of digital (t, m, s)-nets over F(4) improving the best known parameters of (t,...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...
Abstract: (t;m; s )-nets are point sets in Euclidean s-space satisfying certain uniformity condition...
The theory of primitive BCH-codes is used to construct linear tms-nets. The codes provide explicit d...
AbstractIn quasi-Monte Carlo methods, point sets of low discrepancy are crucial for accurate results...
AbstractHigher order nets were introduced by Dick as a generalisation of classical (t,m,s)-nets, whi...
AbstractWe derive two explicit bounds from the linear programming bound for ordered codes and ordere...
this paper is to discuss neural networks, which are based on orthogonal expansions (OE-nets) of unkn...
Summary. Many experiments in computer graphics imply that the average quality of quasi-Monte Carlo i...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...
AbstractIn an article of A. B. Owen (1998, J. Complexity14, 466–489) the question about the distribu...
Summary. Starting from coding-theoretic constructions, we build digital nets with good figures of me...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
We establish a link between the theory of error-correcting codes and the theory of (t,m, s)-nets. Th...
We construct families of digital (t, m, s)-nets over F(4) improving the best known parameters of (t,...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...
Abstract: (t;m; s )-nets are point sets in Euclidean s-space satisfying certain uniformity condition...
The theory of primitive BCH-codes is used to construct linear tms-nets. The codes provide explicit d...
AbstractIn quasi-Monte Carlo methods, point sets of low discrepancy are crucial for accurate results...
AbstractHigher order nets were introduced by Dick as a generalisation of classical (t,m,s)-nets, whi...
AbstractWe derive two explicit bounds from the linear programming bound for ordered codes and ordere...
this paper is to discuss neural networks, which are based on orthogonal expansions (OE-nets) of unkn...
Summary. Many experiments in computer graphics imply that the average quality of quasi-Monte Carlo i...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...