鲁棒分布式信源编码的可实现率失真区域

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI:10.1109/ITW44776.2019.8989299

Arun Padakandla

{"title":"鲁棒分布式信源编码的可实现率失真区域","authors":"Arun Padakandla","doi":"10.1109/ITW44776.2019.8989299","DOIUrl":null,"url":null,"abstract":"We derive a new inner bound to the rate-distortion (RD) region of the robust distributed source coding (RDSC) problem. The derived bound is proven to strictly enlarge the previous known largest for identified examples. This builds on the fixed block-length coding scheme that has been proposed in a series of recent works. Detailed results are available in [1].","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Achievable Rate-Distortion Region for Robust Distributed Source Coding\",\"authors\":\"Arun Padakandla\",\"doi\":\"10.1109/ITW44776.2019.8989299\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We derive a new inner bound to the rate-distortion (RD) region of the robust distributed source coding (RDSC) problem. The derived bound is proven to strictly enlarge the previous known largest for identified examples. This builds on the fixed block-length coding scheme that has been proposed in a series of recent works. Detailed results are available in [1].\",\"PeriodicalId\":214379,\"journal\":{\"name\":\"2019 IEEE Information Theory Workshop (ITW)\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW44776.2019.8989299\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW44776.2019.8989299","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们导出了鲁棒分布式源编码(RDSC)问题的率失真(RD)区域的一个新的内界。证明了所导出的界严格地扩大了已知实例的已知最大值。这建立在固定块长度编码方案的基础上，该方案已在最近的一系列工作中提出。详细结果见b[1]。

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

查看原文本刊更多论文

Achievable Rate-Distortion Region for Robust Distributed Source Coding

We derive a new inner bound to the rate-distortion (RD) region of the robust distributed source coding (RDSC) problem. The derived bound is proven to strictly enlarge the previous known largest for identified examples. This builds on the fixed block-length coding scheme that has been proposed in a series of recent works. Detailed results are available in [1].

求助全文

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

来源期刊

2019 IEEE Information Theory Workshop (ITW)

自引率

0.00%

发文量