Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences
Publication:2347962
DOI10.1016/J.JCO.2014.04.003zbMath1387.11065arXiv1312.5855OpenAlexW1985207554MaRDI QIDQ2347962
Peter Kritzer, Harald Niederreiter
Publication date: 10 June 2015
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5855
global function fieldduality theorylow-discrepancy point setspropagation ruledigital construction methods
Monte Carlo methods (65C05) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45) Special sequences (11K31)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- Duality theory and propagation rules for higher order nets
- A construction of \((t,s)\)-sequences with finite-row generating matrices using global function fields
- On the discrepancy of generalized Niederreiter sequences
- Halton-type sequences from global function fields
- A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Duality for digital nets and its applications
- Constructions of digital nets
- Bounds for digital nets and sequences
- Algebraic Function Fields and Codes
- Duality theory and propagation rules for generalized digital nets
This page was built for publication: Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences