Gyarmati, Katalin and Mauduit, Christian and Sárközy, András (2013) On linear complexity of binary lattices. The Ramanujan Journal, 32 (2). pp. 185-201. ISSN 1382-4090, ESSN: 1572-9303
|
Text
lincomp2.pdf Download (192kB) | Preview |
Abstract
The 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 the linear complexity and the 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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA71 Number theory / számelmélet |
| Depositing User: | Katalin Gyarmati |
| Date Deposited: | 20 Sep 2014 13:25 |
| Last Modified: | 03 Apr 2023 08:14 |
| URI: | http://real.mtak.hu/id/eprint/15630 |
Actions (login required)
 |
Edit Item |
