一般信源定长有损编码的广义截断率界

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI:10.1109/ISIT.2007.4557288

H. Shimokawa

{"title":"一般信源定长有损编码的广义截断率界","authors":"H. Shimokawa","doi":"10.1109/ISIT.2007.4557288","DOIUrl":null,"url":null,"abstract":"This paper investigate Csiszar's generalized cutoff rate for the fixed-length lossy coding of general sources. We obtain an upper bound of generalized cutoff rate and derive Renyi's entropy for the case of loss-less coding. We also derive generalized cutoff rate for memory-less sources with lossy coding. It can be considered as a lossy counterpart of Renyi's entropy.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Bound of Generalized Cutoff Rate for the Fixed-Length Lossy Coding of General Sources\",\"authors\":\"H. Shimokawa\",\"doi\":\"10.1109/ISIT.2007.4557288\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigate Csiszar's generalized cutoff rate for the fixed-length lossy coding of general sources. We obtain an upper bound of generalized cutoff rate and derive Renyi's entropy for the case of loss-less coding. We also derive generalized cutoff rate for memory-less sources with lossy coding. It can be considered as a lossy counterpart of Renyi's entropy.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557288\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

研究了一般信源定长有损编码的cisszar广义截断率。我们得到了广义截止率的上界，并导出了无损编码情况下的Renyi熵。我们还推导了具有有损编码的无内存源的广义截止率。它可以被认为是Renyi熵的有耗对应。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Bound of Generalized Cutoff Rate for the Fixed-Length Lossy Coding of General Sources

This paper investigate Csiszar's generalized cutoff rate for the fixed-length lossy coding of general sources. We obtain an upper bound of generalized cutoff rate and derive Renyi's entropy for the case of loss-less coding. We also derive generalized cutoff rate for memory-less sources with lossy coding. It can be considered as a lossy counterpart of Renyi's entropy.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE International Symposium on Information Theory

自引率

0.00%

发文量