On Lempel-Ziv Complexity of Sequences

DOI10.1007/11863854_15zbMath1152.94378OpenAlexW1542075762MaRDI QIDQ3541920

Faruk Göloğlu, Ali Doğanaksoy

Publication date: 27 November 2008

Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/27279

zbMATH Keywords

randomnessLempel-Ziv complexity\(\chi ^{2}\)-statistics

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Further analysis of the statistical independence of the NIST SP 800-22 randomness tests, Two Lempel - Ziv goodness-of-fit tests for nonequiprobable random binary sequences, New statistical randomness tests: 4-bit template matching tests, On Independence and Sensitivity of Statistical Randomness Tests, Two variants of Lempel - Ziv test for binary sequences