DocumentCode
1845103
Title
Second-order analysis of lossless and lossy versions of Lempel-Ziv codes
Author
Kontoyiannis, Ioannis
Author_Institution
Inf. Syst. Lab., Stanford Univ., CA, USA
Volume
2
fYear
1997
fDate
2-5 Nov. 1997
Firstpage
1349
Abstract
We present an overview of several recent results (some new and some known) on the asymptotic performance of different variants of the Lempel-Ziv coding algorithm, in both the lossless case and the lossy case. The results are based on the asymptotic behavior of waiting times, following the general methodology introduced by Wyner and Ziv (1989). We show that, in this framework, very precise statements can be made about the second-order (asymptotic) properties of the codeword lengths.
Keywords
codes; data compression; Lempel-Ziv codes; asymptotic performance; codeword lengths; data compression; lossless coding; lossy coding; second-order analysis; waiting times; Algorithm design and analysis; Data compression; Databases; Decoding; Information systems; Laboratories; Mathematical model; Pattern matching; Performance analysis; Performance loss;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems & Computers, 1997. Conference Record of the Thirty-First Asilomar Conference on
Conference_Location
Pacific Grove, CA, USA
ISSN
1058-6393
Print_ISBN
0-8186-8316-3
Type
conf
DOI
10.1109/ACSSC.1997.679123
Filename
679123
Link To Document