MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
From MaRDI portal
Publication:974248
DOI10.1016/j.matcom.2007.09.010zbMath1210.65008OpenAlexW2164638483MaRDI QIDQ974248
Rudolf Schürer, Wolfgang Ch. Schmid
Publication date: 27 May 2010
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2007.09.010
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (3)
$\mathbb{F}_q$-Zeros of Sparse Trivariate Polynomials and Toric 3-Fold Codes ⋮ A new class of Latin hypercube designs with high-dimensional hidden projective uniformity ⋮ Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- Low-discrepancy sequences and global function fields with many rational places
- Codes for the \(m\)-metric
- Extensions of generalized product caps
- An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
- A direct approach to linear programming bounds for codes and tms-nets
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Duality for digital nets and its applications
- Bounds for digital nets and sequences
- A Dual Plotkin Bound for $(T,M,S)$-Nets
- A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
- Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
- A construction of low-discrepancy sequences using global function fields
- MinT: A Database for Optimal Net Parameters
This page was built for publication: MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
