H. Niederreiter

activity

20062020

collaborators

6 papers

math.NT2020

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…

math.NT2017

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…

math.NT2016

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…

math.CO2015

Mixed orthogonal arrays, $(u, m, e, s)$ -nets, and $(u, e, s)$ -sequences

Peter Kritzer, Harald Niederreiter

We study the classes of $(u, m, e, s)$ -nets and $(u, e, s)$ -sequences, which are generalizations of $(u, m, s)$ -nets and $(u, s)$ -sequences, respectively. We show equivalence r…

math.NT2012

A construction of (t,s)-sequences with finite-row generating matrices using global function fields

Roswitha Hofer, Harald Niederreiter

For any prime power $q$ and any dimension $s \geq 1$ , we present a construction of $(t, s)$ -sequences in base $q$ with finite-row generating matrices such that, for fixed $q$ , the qu…

math.AG2006

Improved asymptotic bounds for codes using distinguished divisors of global function fields

Harald Niederreiter, Ferruh Özbudak

For a prime power $q$ , let $α_{q}$ be the standard function in the asymptotic theory of codes, that is, $α_{q} (δ)$ is the largest asymptotic information rate that can be achieved for a…