{"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}
引用次数: 1
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].
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
