New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm
Résumé
We give a new analysis and proof of the Normal limiting distribution of the number of phrases in the 1978 Lempel-Ziv compression algorithm on random sequences built from a memoriless source. This work is a follow-up of our last paper on this subject in 1995. The analysis stands on the asymptotic behavior of a DST obtained by the insertion of random sequences. Our proofs are augmented of new results on moment convergence, moderate and large deviations, redundancy analysis.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...