Cart (Loading....) | Create Account
Close category search window

On asymptotic optimality of a sliding window variation of Lempel-Ziv codes

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

2 Author(s)
Morita, H. ; Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan ; Kobayashi, K.

The authors modify the algorithm of Z. Ziv and A. Lempel (1977), LZ77, restricting pointers to start only at the boundary of a previously parsed phrase in a window. Although the number of parsed phrases should increase more than those in LZ77, the number of bits needed to encoded pointers is considerably reduced since the number of possible positions to be encoded is much smaller. It is shown that, for any stationary finite state source, the modified LZ77 code is asymptotically optimal with the convergence rate O(log log M/log M), where M is the size of a sliding window

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 6 )

Date of Publication:

Nov 1993

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.