On the linear complexity of binary lattices

DOI10.1007/S11139-012-9433-3MaRDI QIDQ386502zbMATH OpenOpenAlexFDO

Authors Katalin Gyarmati, Christian Mauduit, András Sárközy

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

zbMATH Keywords

pseudorandomnesslinear complexitylinear recursionbinary latticetwo dimensions

Mathematics Subject Classification ID

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

Recommendations

• On linear complexity of binary lattices. II
• Pseudorandom binary sequences and lattices
• Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
• scientific article; zbMATH DE number 5150220
• Measures of pseudorandomness of finite binary lattices. II: The symmetry measures

Cites work

• scientific article; zbMATH DE number 5619271 (Why is no real title available?)
• scientific article; zbMATH DE number 5150220 (Why is no real title available?)
• scientific article; zbMATH DE number 2051161 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• Linear complexity and related complexity measures
• 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 for finite sequences: typical values
• Measures of pseudorandomness of binary lattices. III: \(Q_k\), correlation, normality, minimal values)
• 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 finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• On pseudorandom binary lattices
• Pseudorandom binary sequences and lattices
• Shift-register synthesis and BCH decoding

Cited in

(7)

• scientific article; zbMATH DE number 6292594 (Why is no real title available?)
• 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)