{"title":"Subset-universal lossy compression","authors":"Or Ordentlich, O. Shayevitz","doi":"10.1109/ITW.2015.7133146","DOIUrl":null,"url":null,"abstract":"A lossy source code C with rate R for a discrete memoryless source S is called subset-universal if for every 0 <; R' <; R, almost every subset of 2nR' of its codewords achieves average distortion close to the source's distortion-rate function D(R'). In this paper we prove the asymptotic existence of such codes. Moreover, we show the asymptotic existence of a code that is subset-universal with respect to all sources with the same alphabet.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"437 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2015.7133146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A lossy source code C with rate R for a discrete memoryless source S is called subset-universal if for every 0 <; R' <; R, almost every subset of 2nR' of its codewords achieves average distortion close to the source's distortion-rate function D(R'). In this paper we prove the asymptotic existence of such codes. Moreover, we show the asymptotic existence of a code that is subset-universal with respect to all sources with the same alphabet.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
