A simple construction for QC-LDPC codes of short lengths with girth at least 8

Inseon Kim, Hong‐Yeop Song
{"title":"A simple construction for QC-LDPC codes of short lengths with girth at least 8","authors":"Inseon Kim, Hong‐Yeop Song","doi":"10.1109/ICTC49870.2020.9289268","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a simple construction for quasi-cyclic low density parity-check codes with girth at least 8 by selecting 3 consecutive rows of a square base matrix over a finite field of size prime p = t2+1 for some t. The bit error rate performance of the codes of lengths 1200 and 2400 are Monte-Carlo simulated.","PeriodicalId":282243,"journal":{"name":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC49870.2020.9289268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a simple construction for quasi-cyclic low density parity-check codes with girth at least 8 by selecting 3 consecutive rows of a square base matrix over a finite field of size prime p = t2+1 for some t. The bit error rate performance of the codes of lengths 1200 and 2400 are Monte-Carlo simulated.
周长至少为8的短长度QC-LDPC码的简单构造
本文提出了一种周长至少为8的拟循环低密度校验码的简单构造方法,方法是在大小为素数p = t2+1的有限域上选取3行连续的方基矩阵,并对长度为1200和2400的码进行蒙特卡罗模拟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信