Redundancy of the Lempel-Ziv codes Conference Paper

abstract

• For unifilar, Markov sources, we demonstrate that the redundancy of encoding the first n letters of the source output with the Lempel-Ziv (1977) string matching code (LZ '77) is O((ln ln n)/(ln n)) and the redundancy with the Lempel-Ziv incremental parsing rule (LZ '78) is O(1/(ln n)); in both cases, we upper bound the exact form of convergence. 1997 IEEE.

name of conference

• Proceedings of IEEE International Symposium on Information Theory

authors

• Savari, Serap

published proceedings

• Proceedings of IEEE International Symposium on Information Theory

author list (cited authors)

• Savari, S. A.

citation count

• 0

complete list of authors

• Savari, SA

publication date

• January 1997

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.1997.613233

International Standard Book Number (ISBN) 10

• 0780339568

International Standard Book Number (ISBN) 13

• 9780780339569

start page

• 309

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.1997.613233