A counterexample concerning the 3-error linear complexity of 2ⁿ -periodic binary sequences

DOI10.1007/S10623-011-9576-ZMaRDI QIDQ438884zbMATH OpenOpenAlexWikidataFDO

Authors Jianqin Zhou

Publication date 31 July 2012

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-011-9576-z

zbMATH Keywords

\(k\)-error linear complexitylinear complexityperiodic sequence

Mathematics Subject Classification ID

Sequences (mod (m)) (11B50) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 6262500
• Counting functions for 2ⁿ-periodic binary sequences with 4-error linear complexity
• 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
• On the 2-error linear complexity of 2ⁿ-periodic balanced binary sequences

Cites work

• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity

Cited in

(5)

• Correction to: ``On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
• Regularity versus complexity in the binary representation of 3ⁿ
• scientific article; zbMATH DE number 6262500 (Why is no real title available?)

This page was built for publication: A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences

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