Gyarmati, Katalin and Mauduit, Christian and Sárközy, András (2014) On linear complexity of binary lattices, II. The Ramanujan Journal, 34 (2). pp. 237-263. ISSN 1382-4090, ESSN: 1572-9303
|
Text
luca.pdf Download (249kB) | Preview |
Abstract
The linear complexity is an important and frequently used measure of unpredictably and pseudorandomness of binary sequences. In Part I of this paper we extended this notion to two dimensions: we defined and studied the linear complexity of binary and bit lattices. In this paper first we will estimate the linear complexity of a truly random bit $(M,N)$-lattice. Next we will extend the notion of $k$-error linear complexity to bit lattices. Finally, we will present another alternative definition of linear complexity of bit lattices.
| 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:30 |
| Last Modified: | 20 Sep 2014 13:30 |
| URI: | http://real.mtak.hu/id/eprint/15632 |
Actions (login required)
 |
Edit Item |
