{"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.