Title :
An almost sure convergence proof of the sliding-window Lempel-Ziv algorithm
Author :
Lastras, Luis A.
Author_Institution :
Multimedia Technol. Dept., IBM TJ Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
An almost sure convergence proof of a finite memory version of the sliding window Lempel-Ziv algorithm (LZ77) is given. The proof is valid for those sources that in addition to being stationary and ergodic, have exponential rates for entropy.
Keywords :
convergence; data compression; entropy; source coding; almost sure convergence proof; data compression; entropy; ergodic sources; finite memory version; sliding-window Lempel-Ziv algorithm; stationary sources; Convergence; Cost function; Data compression; Databases; Electronic mail; Entropy; H infinity control; Length measurement; Random processes; Size measurement;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023393
