An almost sure convergence proof of the sliding-window Lempel-Ziv algorithm

Luis Lastras · 2003

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.

Read the paper · More papers on PaperTik