By Topic

Improved redundancy of a version of the 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

2 Author(s)
Wyner, A.D. ; AT&T Bell Labs., Murray Hill, NJ, USA ; Wyner, A.J.

The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy ρn (defined as the difference between the average code rate and the entropy when the memory size is n) is O (log log n/log n). We suggest a new version of the algorithm with redundancy ρn=O (1/log n)

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 3 )