The linear complexity of a sequence is not only a measure for the unpredictability and thus
suitability for cryptography but also of interest in information theory because of its close …

Chapter 4 PSEUDORANDOM SEQUENCES Page 1 Chapter 4 PSEUDORANDOM
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …

CONSTRUCTION OF PSEUDORANDOM BINARY SEQUENCES BY USING THE
MULTIPLICATIVE INVERSE Page 1 Acta Math. Hungar. 108 (3) (2005), 239–252 …

A high linear complexity profile is a desirable feature of sequences used for cryptographical
purposes. For a given binary sequence we estimate its linear complexity profile in terms of …

In earlier papers we introduced the measures of pseudorandomness of finite binary
sequences [13], introduced the notion of f–complexity of families of binary sequences …

Compressed sensing exploits the signal's sparsity by non-uniform sampling to achieve high-
quality signal reconstruction at low sampling rates. This work aims to show the efficient …

In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new
quantitative theory of pseudorandomness of binary sequences. Since then numerous …

The Legendre symbol is applied to the rational points over an elliptic curve to output a family
of binary sequences with strong pseudorandom properties. That is, both the well-distribution …

Recently a constructive theory of pseudorandomness of binary sequences has been
developed and many constructions for binary sequences with strong pseudorandom …

In an earlier paper Hubert and the authors introduced and studied the notion of
pseudorandomness of binary lattices, and they also gave a construction for a binary lattice …