20 citations · 35 across the 12 of their papers we have counts for
12 papers
Perfect linear complexity profile and Apwenian sequences
J. -P. Allouche, G. -N. Han, H. Niederreiter
Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwen…
On the expansion complexity of sequences over finite fields
Gómez-Pérez, László Mérai, Harald Niederreiter
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irredu…
Expansion complexity and linear complexity of sequences over finite fields
László Mérai, Harald Niederreiter, Arne Winterhof
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of…
Mixed orthogonal arrays, -nets, and -sequences
Peter Kritzer, Harald Niederreiter
We study the classes of -nets and -sequences, which are generalizations of -nets and -sequences, respectively. We show equivalence r…
Multisequences with high joint nonlinear complexity
Wilfried Meidl, Harald Niederreiter
We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive…
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…
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…
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…
Halton-type sequences from global function fields
Harald Niederreiter, Anderson Siang Jing Yeo
For any prime power and any dimension , a new construction of -sequences in base using global function fields is presented. The construction yields an analog of H…
A construction of (t,s)-sequences with finite-row generating matrices using global function fields
Roswitha Hofer, Harald Niederreiter
For any prime power and any dimension , we present a construction of -sequences in base with finite-row generating matrices such that, for fixed , the qu…
Improved asymptotic bounds for codes using distinguished divisors of global function fields
Harald Niederreiter, Ferruh Özbudak
For a prime power , let be the standard function in the asymptotic theory of codes, that is, is the largest asymptotic information rate that can be achieved for a…
Codes for Key Generation in Quantum Cryptography
Berthold-Georg Englert, Fang-Wei Fu, Harald Niederreiter +1
As an alternative to the usual key generation by two-way communication in schemes for quantum cryptography, we consider codes for key generation by one-way communication. We study…