相对冗余:更严格的通用压缩性能保证

A. Orlitsky, N. Santhanam, Junan Zhang
{"title":"相对冗余:更严格的通用压缩性能保证","authors":"A. Orlitsky, N. Santhanam, Junan Zhang","doi":"10.1109/ISIT.2004.1365061","DOIUrl":null,"url":null,"abstract":"Standard redundancy measures the excess number of bits needed to compress sequences of a given length. Instead, we consider relative redundancy that measures the excess number of bits for sequences of a given minimum description length. Low relative redundancy implies that number of bits needed to compress any sequence is essentially the lowest possible. We show that low relative redundancy implies low standard redundancy, that while block relative redundancy resembles block standard redundancy, sequential relative redundancy is twice its counterpart, and that common algorithms achieving standard redundancy have unbounded relative redundancy.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Relative redundancy: a more stringent performance guarantee for universal compression\",\"authors\":\"A. Orlitsky, N. Santhanam, Junan Zhang\",\"doi\":\"10.1109/ISIT.2004.1365061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Standard redundancy measures the excess number of bits needed to compress sequences of a given length. Instead, we consider relative redundancy that measures the excess number of bits for sequences of a given minimum description length. Low relative redundancy implies that number of bits needed to compress any sequence is essentially the lowest possible. We show that low relative redundancy implies low standard redundancy, that while block relative redundancy resembles block standard redundancy, sequential relative redundancy is twice its counterpart, and that common algorithms achieving standard redundancy have unbounded relative redundancy.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365061\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

标准冗余度量压缩给定长度的序列所需的多余位数。相反,我们考虑相对冗余,即测量给定最小描述长度的序列的多余位数。低相对冗余意味着压缩任何序列所需的比特数本质上是尽可能少的。我们证明了低相对冗余意味着低标准冗余,而块相对冗余类似于块标准冗余,顺序相对冗余是其对应的两倍,并且实现标准冗余的常见算法具有无界的相对冗余。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Relative redundancy: a more stringent performance guarantee for universal compression
Standard redundancy measures the excess number of bits needed to compress sequences of a given length. Instead, we consider relative redundancy that measures the excess number of bits for sequences of a given minimum description length. Low relative redundancy implies that number of bits needed to compress any sequence is essentially the lowest possible. We show that low relative redundancy implies low standard redundancy, that while block relative redundancy resembles block standard redundancy, sequential relative redundancy is twice its counterpart, and that common algorithms achieving standard redundancy have unbounded relative redundancy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信