On linear complexity of binary lattices. II
From MaRDI portal
Publication:457014
DOI10.1007/S11139-013-9500-4zbMATH Open1314.11049OpenAlexW2016009009MaRDI QIDQ457014FDOQ457014
András Sárközy, Katalin Gyarmati, Christian Mauduit
Publication date: 26 September 2014
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-013-9500-4
Recommendations
Cites Work
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Title not available (Why is that?)
- On pseudorandom binary lattices
- On the k-error linear complexity of cyclotomic sequences
- 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 the linear complexity of binary lattices
Cited In (7)
- Title not available (Why is that?)
- Enumeration results on linear complexity profiles and lattice profiles
- 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
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
This page was built for publication: On linear complexity of binary lattices. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457014)
