On linear complexity of binary lattices. II

DOI10.1007/s11139-013-9500-4zbMath1314.11049OpenAlexW2016009009MaRDI QIDQ457014

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

zbMATH Keywords

two dimensionslinear complexitypseudorandomnesslinear recursionbinary lattice

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

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
• On the linear complexity of 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)
• On pseudorandom binary lattices
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On the k-error linear complexity of cyclotomic sequences