New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm

Abstract

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.
Fichier principal
Vignette du fichier
LZ-RR.pdf (228.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00476902 , version 1 (27-04-2010)

Identifiers

  • HAL Id : inria-00476902 , version 1

Cite

Philippe Jacquet, Szpankowski Wojciech. New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm. [Research Report] 2010. ⟨inria-00476902⟩
182 View
43 Download

Share

Gmail Facebook X LinkedIn More