任意离散源的速率失真定理

IEEE Trans. Inf. Theory Pub Date : 1998-07-01 DOI:10.1109/18.681347

Po-Ning Chen, F. Alajaji

{"title":"任意离散源的速率失真定理","authors":"Po-Ning Chen, F. Alajaji","doi":"10.1109/18.681347","DOIUrl":null,"url":null,"abstract":"A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of the minimum /spl epsiv/-achievable fixed-length coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdu (see ibid., vol.42, p.63-86 (Jan. 1996).","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"53 1","pages":"1666-1668"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Rate-Distortion Theorem for Arbitrary Discrete Sources\",\"authors\":\"Po-Ning Chen, F. Alajaji\",\"doi\":\"10.1109/18.681347\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of the minimum /spl epsiv/-achievable fixed-length coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdu (see ibid., vol.42, p.63-86 (Jan. 1996).\",\"PeriodicalId\":13250,\"journal\":{\"name\":\"IEEE Trans. Inf. Theory\",\"volume\":\"53 1\",\"pages\":\"1666-1668\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Trans. Inf. Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/18.681347\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Inf. Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/18.681347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

给出了任意(不一定是平稳的或遍历的)离散有限字母源的速率畸变定理。这个结果提供了在保真度标准下可实现的最小/spl epsiv/-固定长度编码率的表达式，扩展了Steinberg和Verdu最近提出的数据压缩定理(见同上，vol.42, p.63-86(1996年1月))。

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

查看原文本刊更多论文

A Rate-Distortion Theorem for Arbitrary Discrete Sources

A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of the minimum /spl epsiv/-achievable fixed-length coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdu (see ibid., vol.42, p.63-86 (Jan. 1996).

求助全文

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

来源期刊

IEEE Trans. Inf. Theory

自引率

0.00%

发文量