A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences

DOI10.1007/S10623-011-9576-ZzbMath1243.94023OpenAlexW1979651630WikidataQ124812679 ScholiaQ124812679MaRDI QIDQ438884

Jian-Qin 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

linear complexityperiodic sequence\(k\)-error linear complexity

Mathematics Subject Classification ID

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

Related Items (2)

On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences

Cites Work

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

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