Browsing by Subject "Lempel-Ziv complexity"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    ItemOpen Access
    On Lempel-Ziv complexity of sequences
    (Springer, Berlin, Heidelberg, 2006) Doǧanaksoy, A.; Göloǧlu, Faruk
    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. EPn, 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.