On the Fast Computation of the Weight Enumerator Polynomial and the $t$ Value of Digital Nets over Finite Abelian Groups

DOI10.1137/120893677zbMath1316.11068arXiv1210.0776OpenAlexW2964258169MaRDI QIDQ2870510

Makoto Matsumoto, Josef Dick

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0776

zbMATH Keywords

quasi-Monte Carlodigital netfinite abelian groupweight enumerator polynomialMac Williams identity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (9)

Quasi-Monte Carlo point sets with small \(t\)-values and WAFOM ⋮ A search for extensible low-WAFOM point sets ⋮ Comparison of Sobol' sequences in financial applications ⋮ Walsh Figure of Merit for Digital Nets: An Easy Measure for Higher Order Convergent QMC ⋮ Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series ⋮ Digital net properties of a polynomial analogue of Frolov's construction ⋮ Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration ⋮ An algorithm to compute the \(t\)-value of a digital net and of its projections ⋮ The \(b\)-adic tent transformation for quasi-Monte Carlo integration using digital nets

This page was built for publication: On the Fast Computation of the Weight Enumerator Polynomial and the $t$ Value of Digital Nets over Finite Abelian Groups