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

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码的存在性,给出了畸变判据和奇偶校验矩阵参数的若干条件
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信