Redundancy of the Lempel-Ziv string matching code
- Additional Document Info
- View All
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. 1998 IEEE.
IEEE Transactions on Information Theory
author list (cited authors)
complete list of authors