准循环LDPC码的谱图

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

R. M. Tanner

{"title":"准循环LDPC码的谱图","authors":"R. M. Tanner","doi":"10.1109/ISIT.2001.936089","DOIUrl":null,"url":null,"abstract":"Quasi-cyclic codes are described in terms of code equations on the spectral components of constituent cyclic codes. These define a constraint graph in the spectral domain. Here spectral graphs define low density parity check codes (LDPC) codes for which minimum distance can be bounded with algebraic and graph-based arguments. Examples include [42,22,8] and [155,64,20] regular LPDC codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"Spectral graphs for quasi-cyclic LDPC codes\",\"authors\":\"R. M. Tanner\",\"doi\":\"10.1109/ISIT.2001.936089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quasi-cyclic codes are described in terms of code equations on the spectral components of constituent cyclic codes. These define a constraint graph in the spectral domain. Here spectral graphs define low density parity check codes (LDPC) codes for which minimum distance can be bounded with algebraic and graph-based arguments. Examples include [42,22,8] and [155,64,20] regular LPDC codes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"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.936089\",\"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.936089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 39

摘要

用组成循环码的谱分量上的码方程来描述拟循环码。这些定义了谱域中的约束图。这里谱图定义了低密度奇偶校验码(LDPC)码，其最小距离可以用代数和基于图的参数来限定。示例包括正则LPDC码[42,22,8]和[155,64,20]。

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

查看原文本刊更多论文

Spectral graphs for quasi-cyclic LDPC codes

Quasi-cyclic codes are described in terms of code equations on the spectral components of constituent cyclic codes. These define a constraint graph in the spectral domain. Here spectral graphs define low density parity check codes (LDPC) codes for which minimum distance can be bounded with algebraic and graph-based arguments. Examples include [42,22,8] and [155,64,20] regular LPDC codes.

求助全文

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

来源期刊

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

自引率

0.00%

发文量