On Lempel-Ziv Complexity of Sequences

  • Doğanaksoy A
  • Göloğlu F
  • 42


    Mendeley users who have this article in their library.
  • 20


    Citations of this article.


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 n , 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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Ali Doğanaksoy

  • Faruk Göloğlu

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free