扩展器代码的错误指数

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.935910

A. Barg, G. Zémor

{"title":"扩展器代码的错误指数","authors":"A. Barg, G. Zémor","doi":"10.1109/ISIT.2001.935910","DOIUrl":null,"url":null,"abstract":"We show that expander codes attain the capacity of the binary symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between 0 and channel capacity. The decoding complexity grows linearly with code length.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"103","resultStr":"{\"title\":\"Error exponents of expander codes\",\"authors\":\"A. Barg, G. Zémor\",\"doi\":\"10.1109/ISIT.2001.935910\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that expander codes attain the capacity of the binary symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between 0 and channel capacity. The decoding complexity grows linearly with code length.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"103\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935910\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 103

摘要

我们证明了扩展码在迭代译码下达到二进制对称信道的容量。对于在0和信道容量之间的所有速率，错误概率都是一个正指数。译码复杂度随码长线性增长。

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

查看原文本刊更多论文

Error exponents of expander codes

We show that expander codes attain the capacity of the binary symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between 0 and channel capacity. The decoding complexity grows linearly with code length.

求助全文

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

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量