一些基于电压图的大周长LDPC尾码

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI:10.1109/ISIT.2011.6034230

I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov

{"title":"一些基于电压图的大周长LDPC尾码","authors":"I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov","doi":"10.1109/ISIT.2011.6034230","DOIUrl":null,"url":null,"abstract":"The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Some voltage graph-based LDPC tailbiting codes with large girth\",\"authors\":\"I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov\",\"doi\":\"10.1109/ISIT.2011.6034230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6034230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

准循环低密度校验码的校验矩阵与二部图的双邻接矩阵之间的关系为搜索强大的LDPC分组码提供了支持。提出了大周长LDPC分组码的迭代搜索算法，并介绍了基于Steiner三重系统和短QC分组码的构造，得到了周长不超过24的新的QC规则LDPC分组码。

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

查看原文本刊更多论文

Some voltage graph-based LDPC tailbiting codes with large girth

The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.

求助全文

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

来源期刊

2011 IEEE International Symposium on Information Theory Proceedings

自引率

0.00%

发文量