20 citations · 35 across the 12 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.NT2013
Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences
Peter Kritzer, Harald Niederreiter
The classes of -nets and -sequences were recently introduced by Tezuka, and in a slightly more restrictive form by Hofer and Niederreiter. We study…
cs.IT2013
Sequences with high nonlinear complexity
Harald Niederreiter, Chaoping Xing
We improve lower bounds on the th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the th-or…
math.NT2013★ 2 cited
Explicit constructions of Vandermonde sequences using global function fields
Roswitha Hofer, Harald Niederreiter
The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via co…