On Lempel-Ziv complexity of sequences

Date

2006

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
4
views
11
downloads

Citation Stats

Series

Abstract

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.

Source Title

Sequences and Their Applications – SETA 2006

Publisher

Springer, Berlin, Heidelberg

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Language

English