{"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}
引用次数: 39
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
