Redundancy of the Lempel-Ziv string matching code Academic Article uri icon


  • 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.

published proceedings

  • IEEE Transactions on Information Theory

author list (cited authors)

  • Savari, S. A.

citation count

  • 20

complete list of authors

  • Savari, SA

publication date

  • March 1998