Digital nets and coding theory
Digital nets arise in multidimensional numerical integration as point configurations with excellent uniform distribution properties. The paper reports on the close connection between digital nets and linear codes. After reviewing the standard construction of nets by the digital method which was introduced by the author [``Point sets and sequences with small discrepancy, Monatsh. Math. 104, 273--337 (1987; Zbl 0626.10045)], he describes connections between digital nets and coding theory, in particular, in the context of duality theory which was introduced to the theory of digital nets by the author and \textit{G. Pirsić} [``Duality for digital nets and its applications, Acta Arith. 97, No. 2, 173--182 (2001; Zbl 0972.11066)]. The new concept of cyclic digital nets (the analogs of cyclic codes) is introduced and the asymptotic of digital-net parameters is discussed. For the entire collection see [Zbl 1047.94002].
- On the existence and distribution quality of hyperplane sequences
- Constructions of (t,m,s)-nets and (t,s)-sequences
- On the fast computation of the weight enumerator polynomial and the t value of digital nets over finite abelian groups
- A Coding Theoretic Approach to Building Nets with Well-Equidistributed Projections
- Linear codes on posets with extension property
- Construction of digital nets from BCH-codes
- A computable figure of merit for quasi-Monte Carlo point sets
- Extensible hyperplane nets
- Duality for digital sequences
- Quasi-Monte Carlo methods with applications in finance
This page was built for publication: Digital nets and coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154868)
