Analysis of the linear complexity and its stability for periodic binary sequences

MaRDI QIDQ5425100zbMATH OpenFDO

Authors Zhihua Niu, Naicheng Li, Guozhen Xiao

Publication date 8 November 2007

zbMATH Keywords

\(k\)-error linear complexitylinear complexityperiodic sequencessteam ciphers

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• scientific article; zbMATH DE number 5651473
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity

Cited in

(5)

• Composition of recursions and nonlinear complexity of periodic binary sequences
• On the calculation of the linear complexity of periodic sequences
• Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• A Note on the Periodicity and the Output Rate of Bit Search Type Generators

This page was built for publication: Analysis of the linear complexity and its stability for periodic binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425100)