About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 2002
Conference paper
An almost sure convergence proof of the sliding-window Lempel-Ziv algorithm
Abstract
The convergence proof of a finite memory version of the sliding window Lempel-Ziv algorithm (LZ77) was presented. This proof is valid for those sources which are stationary, ergodic and have exponential rates for entropy. It was shown that if the source is stationary, ergodic and possesses exponential rates for entropy, the compression ratio of the algorithm, when operating on each individual finite sequence, approaches infinity, except for a set of source sequences with measure ratio.