Bounds for digital nets and sequences

From MaRDI portal





Digital \((t,m,s)\)-nets and \((t,s)\)-sequences play an important role in the theory of low-discrepancy point sets and sequences in the \(s\)-dimensional unit cube. This paper is devoted to improvements concerning the lower and upper bounds for the dimension \(s\) of digital nets and sequences dependent on the so-called quality parameter \(t\). First it is shown that the so-called propagation rules for general nets also work for digital nets. In the second section, a new upper bound for the dimension of digital nets in prime power base \(q\) is obtained which is the best possible result that can be obtained by the ``methods of linear combinations. Further, \textit{H. Niederreiter} and \textit{C. Xing}'s construction method based on global function fields is shown to be best possible for some cases of binary sequences [Acta Arith. 73, 87-102 (1995; Zbl 0848.11038)]. In the third section, a construction method based on the theory of linear codes is improved in the case of digital \((t,t+4,s)\)-nets over \(\mathbb{F}_q\). Finally, some concrete digital \((t,t+k,s)\)-nets over \(\mathbb{F}_2\) with small \(k\) are provided and shown to be best possible.




Cited in
(28)








This page was built for publication: Bounds for digital nets and sequences

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