A new construction of (t,s)-sequences and some improved bounds on their quality parameter

DOI10.4064/AA128-2-8zbMATH Open1207.11079OpenAlexW2051273659MaRDI QIDQ5293291FDOQ5293291

Authors: David J. S. Mayor, Harald Niederreiter 

Publication date: 29 June 2007

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa128-2-8

Recommendations

• A construction of \((t,s)\)-sequences with finite-row generating matrices using global function fields
• A new lower bound on the \(t\)-parameter of \((t,s)\)-sequences
• Bounds for digital nets and sequences
• On the lower bound of the discrepancy of \((t,s)\)-sequences. II
• A construction of low-discrepancy sequences using global function fields

zbMATH Keywords

low-discrepancy sequences\((t,s)\)-sequencestower of global function fields

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45) Arithmetic theory of algebraic function fields (11R58)

Cited In (7)

• A new lower bound on the \(t\)-parameter of \((t,s)\)-sequences
• New Extensions and Applications of Welch-Bound-Equality Sequence Sets
• A construction of \((t,s)\)-sequences with finite-row generating matrices using global function fields
• Variations on \((0,s)\)-sequences
• Halton-type sequences from global function fields
• Low-discrepancy sequences using duality and global function fields
• A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences

Uses Software

• MinT

This page was built for publication: A new construction of (t,s)-sequences and some improved bounds on their quality parameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5293291)