{"title":"无损和有损版本Lempel-Ziv码的二阶分析","authors":"I. Kontoyiannis","doi":"10.1109/ACSSC.1997.679123","DOIUrl":null,"url":null,"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.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Second-order analysis of lossless and lossy versions of Lempel-Ziv codes\",\"authors\":\"I. Kontoyiannis\",\"doi\":\"10.1109/ACSSC.1997.679123\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":240431,\"journal\":{\"name\":\"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.1997.679123\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1997.679123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Second-order analysis of lossless and lossy versions of Lempel-Ziv codes
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
