Properties of maximum Lempel-Ziv complexity strings
Chaotic Dynamics
2013-11-05 v1 Information Theory
math.IT
Abstract
The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The non-stationary character of the MLZs are discussed. The issue of sensitiveness to noise is also addressed. An empirical ansatz is found that fits well to the Lempel-Ziv complexity of the MLZs for all lengths up to symbols.
Cite
@article{arxiv.1311.0822,
title = {Properties of maximum Lempel-Ziv complexity strings},
author = {C. A. J. Nunes and E. Estevez-Rams and B. Aragón Fernández and R. Lora Serrano},
journal= {arXiv preprint arXiv:1311.0822},
year = {2013}
}