Abstract
We present a survey of recent work on the linear complexity, the linear complexity profile, and the κ-error linear complexity of sequences and on the joint linear complexity of multisequences. We also establish a new enumeration theorem on multisequences and state several open problems. The material is of relevance for the assessment of keystreams in stream ciphers. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Niederreiter, H. (2003). Linear complexity and related complexity measures for sequences. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2904, 1–17. https://doi.org/10.1007/978-3-540-24582-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
