By Topic

Redundancy of the Lempel-Ziv string matching code

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)
Savari, S.A. ; Lucent Technol., Bell Labs., Murray Hill, NJ, USA

For any given source output string from a unifilar, Markov source, we bound from above the amount by which the number of binary digits used by two variants of LZ'77 to encode the string exceeds its self-information as a function of its length and self-information

Published in:

Information Theory, IEEE Transactions on  (Volume:44 ,  Issue: 2 )