An almost sure convergence proof of the sliding window Lempel
Ziv algorithm (LZ77) is given. The proof is valid for those sources that
in addition of being stationary and ergodic, have exponential rates for
entropy.
By: Luis A. Lastras
Published in: Proceedings of 2002 IEEE International Symposium on Information Theory, IEEE, p.121 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .