一种有效的准循环LDPC码环定位算法

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

Xiaofu Wu, X. You, Chunming Zhao

{"title":"一种有效的准循环LDPC码环定位算法","authors":"Xiaofu Wu, X. You, Chunming Zhao","doi":"10.1109/ISIT.2006.261727","DOIUrl":null,"url":null,"abstract":"The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"14 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes\",\"authors\":\"Xiaofu Wu, X. You, Chunming Zhao\",\"doi\":\"10.1109/ISIT.2006.261727\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"14 6\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261727\",\"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.261727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

拟循环码的校验矩阵可以用一个显著低维的多项式校验矩阵来表示。利用这种紧凑表示，我们可以建立一种定位拟循环码周长的有效方法。所提出的周长定位算法可以很好地用于生成大周长的准循环低密度校验码

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

查看原文

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

本刊更多论文

An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes

The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth

求助全文

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

来源期刊

2006 IEEE International Symposium on Information Theory

自引率

0.00%

发文量