On the linear complexity of binary lattices
From MaRDI portal
Publication:386502
DOI10.1007/S11139-012-9433-3zbMATH Open1312.11063OpenAlexW1999525089MaRDI QIDQ386502FDOQ386502
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Shift-register synthesis and BCH decoding
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Measures of pseudorandomness for finite sequences: typical values
- Linear complexity profile of binary sequences with small correlation measure
- On pseudorandom binary lattices
- 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
- Pseudorandom binary sequences and lattices
- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
Cited In (7)
- Title not available (Why is that?)
- Enumeration results on linear complexity profiles and lattice profiles
- On linear complexity of binary lattices. II
- Multidimensional linear complexity analysis of periodic arrays
- On the linear complexity for multidimensional sequences
- On the trellis complexity of root lattices and their duals
- On finite pseudorandom binary lattices
This page was built for publication: On the linear complexity of binary lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386502)
