On evaluating the linear complexity of a sequence of least period \(2^ n\)

DOI10.1007/BF01388455zbMath0794.94003OpenAlexW2027685876MaRDI QIDQ1329115

Matthew J. B. Robshaw

Publication date: 4 September 1994

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

Full work available at URL: https://doi.org/10.1007/bf01388455

zbMATH Keywords

algorithmlinear complexityfeedback shift register

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (2)

Linear Complexity of Periodic Sequences: A General Theory ⋮ Sequences with good correlation property based on depth and interleaving techniques

Cites Work

• Unnamed Item
• Analysis and design of stream ciphers
• On the complexities of de-Bruijn sequences
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• Shift-register synthesis and BCH decoding

This page was built for publication: On evaluating the linear complexity of a sequence of least period \(2^ n\)