On the linear complexity of binary lattices
From MaRDI portal
Publication:386502
DOI10.1007/s11139-012-9433-3zbMath1312.11063OpenAlexW1999525089MaRDI QIDQ386502
Katalin Gyarmati, András Sárközy, Christian Mauduit
Publication date: 9 December 2013
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/15630/1/lincomp2.pdf
Related Items
On linear complexity of binary lattices. II ⋮ On finite pseudorandom binary lattices ⋮ On the linear complexity for multidimensional sequences ⋮ Multidimensional linear complexity analysis of periodic arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- Linear complexity profile of binary sequences with small correlation measure
- Measures of pseudorandomness of families of binary lattices, I (Definitions, a construction using quadratic characters)
- Measures of pseudorandomness of families of binary lattices, II (A further construction)
- On pseudorandom binary lattices
- Pseudorandom binary sequences and lattices
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Measures of pseudorandomness for finite sequences: typical values
- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
- Shift-register synthesis and BCH decoding
