Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/103492
| Title: | Linear complexity and related complexity measures for sequences | Authors: | Niederreiter, H. | Issue Date: | 2003 | Citation: | 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. ScholarBank@NUS Repository. | 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. | Source Title: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | URI: | http://scholarbank.nus.edu.sg/handle/10635/103492 | ISSN: | 03029743 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.