LDPC码在Zq上的有损数据压缩

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI:10.1109/ISIT.2006.261726

S. Miyake

{"title":"LDPC码在Zq上的有损数据压缩","authors":"S. Miyake","doi":"10.1109/ISIT.2006.261726","DOIUrl":null,"url":null,"abstract":"For cases other than the binary alphabet, we construct an LDPC code with the fidelity criterion for uniformly distributed sources on Z q, which asymptotically achieves the rate-distortion limit. For the existence of the LDPC code, we derive some conditions for the distortion criterion and for the parameters of the parity check matrix","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Lossy Data Compression over Zq by LDPC Code\",\"authors\":\"S. Miyake\",\"doi\":\"10.1109/ISIT.2006.261726\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For cases other than the binary alphabet, we construct an LDPC code with the fidelity criterion for uniformly distributed sources on Z q, which asymptotically achieves the rate-distortion limit. For the existence of the LDPC code, we derive some conditions for the distortion criterion and for the parameters of the parity check matrix\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261726\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

对于非二进制字母，我们构造了一种LDPC码，该码具有zq上均匀分布源的保真度准则，渐近地达到了速率失真极限。对于LDPC码的存在性，给出了畸变判据和奇偶校验矩阵参数的若干条件

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Lossy Data Compression over Zq by LDPC Code

For cases other than the binary alphabet, we construct an LDPC code with the fidelity criterion for uniformly distributed sources on Z q, which asymptotically achieves the rate-distortion limit. For the existence of the LDPC code, we derive some conditions for the distortion criterion and for the parameters of the parity check matrix

求助全文

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

来源期刊

2006 IEEE International Symposium on Information Theory

自引率

0.00%

发文量