Compressibility of Deterministic and Random Infinite Sequences

We introduce a definition of the notion of compressibility for infinite deterministic and i.i.d. random sequences which is based on the asymptotic behavior of truncated subsequences. For this purpose, we use asymptotic results regarding the distribution of order statistics for heavy-tail distributions and their link with alpha-stable laws for1 < alpha < 2. In many cases, our proposed definition of compressibility coincides with intuition. In particular, we prove that heavy-tail (polynomial decaying) distributions fulfill the requirements of compressibility. On the other hand, exponential decaying distributions like Laplace and Gaussian do not. The results are such that two compressible distributions can be compared with each other in terms of their degree of compressibility.


Published in:
Ieee Transactions On Signal Processing, 59, 5193-5201
Year:
2011
Publisher:
IEEE
Keywords:
Laboratories:




 Record created 2011-12-16, last modified 2018-03-17

External links:
Download fulltextURL
Download fulltextURL
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)