On Lempel-Ziv complexity of sequences
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27279
We derive recurrences for counting the number a(n, r) of sequences of length n with Lempel-Ziv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute these recurrences. We employed these algorithms to compute a(n, r) and expected value. EP<inf>n</inf>, of number of patterns of a sequence of length n, for relatively large n. We offer a randomness test based on the algorithms to be used for testing randomness of binary sequences. We give outputs of the algorithms for some n. We also provide results of the proposed test applied to the outputs of contestant stream ciphers of ECRYPT's eSTREAM. © Springer-Verlag Berlin Heidelberg 2006.
- Conference Paper 2294