子集通用有损压缩

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-11-03 DOI:10.1109/ITW.2015.7133146

Or Ordentlich, O. Shayevitz

{"title":"子集通用有损压缩","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":"{\"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}","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

摘要

离散无内存源S的率为R的有损源代码C称为子集泛型，如果对每一个0 <;R ' <;R，其码字的几乎每个2nR'子集都达到接近源失真率函数D(R')的平均失真。本文证明了这类码的渐近存在性。此外，我们还证明了一个码的渐近存在性，该码对于所有具有相同字母表的源都是子集泛的。

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

查看原文本刊更多论文

Subset-universal lossy compression

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.

求助全文

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

来源期刊

2015 IEEE Information Theory Workshop (ITW)

自引率

0.00%

发文量