Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lastras, L.A. ; Multimedia Technol. Dept., IBM TJ Watson Res. Center, Yorktown Heights, NY, USA

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.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002