Redundancy of the Lempel-Ziv string matching code

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. 1998 IEEE.

authors

• Savari, Serap

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

• January 1998

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Data Compression
• Lempel-ziv Codes
• Unifilar Markov Sources

Digital Object Identifier (DOI)

• 10.1109/18.661522

start page

• 787

end page

• 791

volume

• 44

issue

• 2

URL

• http://dx.doi.org/10.1109/18.661522