Title :
Redundancy of the Lempel-Ziv string matching code
Author :
Savari, Serap A.
Author_Institution :
Lucent Technol., Bell Labs., Murray Hill, NJ, USA
fDate :
3/1/1998 12:00:00 AM
Abstract :
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
Keywords :
Markov processes; source coding; string matching; Lempel-Ziv string matching code; binary digits; bound; lossless data compression; pointwise code length; redundancy; self-information; source coding; source output string; unifilar Markov source; Data compression; Encoding; Entropy; Information theory; Steady-state;
Journal_Title :
Information Theory, IEEE Transactions on
