On the linear complexity of binary lattices - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Ramanujan Journal Année : 2013

On the linear complexity of binary lattices

Résumé

Linear complexity is an important and frequently used measure of unpredictability and pseudorandomness of binary sequences. In this paper our goal is to extend this notion to two dimensions. We will define and study the linear complexity of binary lattices. The linear complexity of a truly random binary lattice will be estimated. Finally, we will analyze the connection between linear complexity and correlation measures, and we will utilize the inequalities obtained in this way for estimating the linear complexity of an important special binary lattice. Finally, we will study the connection between the linear complexity of binary lattices and of the associated binary sequences.

Dates et versions

hal-01272321 , version 1 (10-02-2016)

Identifiants

Citer

Katalin Gyarmati, Christian Mauduit, András Sárközy. On the linear complexity of binary lattices. Ramanujan Journal, 2013, 32 (2), pp.185-201. ⟨10.1007/s11139-012-9433-3⟩. ⟨hal-01272321⟩
171 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More