具有解码器侧信息的最大失真约束下的有损源编码

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI:10.1109/ISIT.2004.1365370

J. Nayak, E. Tuncel, K. Rose

{"title":"具有解码器侧信息的最大失真约束下的有损源编码","authors":"J. Nayak, E. Tuncel, K. Rose","doi":"10.1109/ISIT.2004.1365370","DOIUrl":null,"url":null,"abstract":"A basic problem in information theory is source coding under a distortion constraint when the decoder has side-information about the source. In this paper the problem of variable length coding of a memoryless source under a maximum distortion constraint when there is side-information solely at the decoder is focused. Using a combinatorial approach, a nonsingle-letter expression for the minimum asymptotic average rate as well as single-letter bounds on this rate is derived","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lossy source coding under a maximum distortion constraint with decoder side-information\",\"authors\":\"J. Nayak, E. Tuncel, K. Rose\",\"doi\":\"10.1109/ISIT.2004.1365370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A basic problem in information theory is source coding under a distortion constraint when the decoder has side-information about the source. In this paper the problem of variable length coding of a memoryless source under a maximum distortion constraint when there is side-information solely at the decoder is focused. Using a combinatorial approach, a nonsingle-letter expression for the minimum asymptotic average rate as well as single-letter bounds on this rate is derived\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.1365370\",\"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.1365370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

信息论中的一个基本问题是，当解码器具有有关信源的侧信息时，在失真约束下对信源进行编码。本文主要研究了在最大失真约束下，当解码器处只有侧信息时，无记忆信源的变长编码问题。利用组合方法，导出了最小渐近平均速率的非单字母表达式以及该速率的单字母界

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

查看原文本刊更多论文

Lossy source coding under a maximum distortion constraint with decoder side-information

A basic problem in information theory is source coding under a distortion constraint when the decoder has side-information about the source. In this paper the problem of variable length coding of a memoryless source under a maximum distortion constraint when there is side-information solely at the decoder is focused. Using a combinatorial approach, a nonsingle-letter expression for the minimum asymptotic average rate as well as single-letter bounds on this rate is derived

求助全文

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

来源期刊

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

自引率

0.00%

发文量