| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 395790 | Information Sciences | 2009 | 4 Pages |
Abstract
Investigations of complexity of sequences lead to important applications such as effective data compression, testing of randomness, discriminating between information sources and many others. In this paper we establish formulae describing the distribution functions of random variables representing the complexity of finite sequences introduced by Lempel and Ziv in 1976. It is known that this quantity can be used as an estimator of entropy. We show that the distribution functions depend affinely on the probabilities of the so-called “exact” sequences.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Janusz Szczepanski,