周长至少为8的短长度QC-LDPC码的简单构造

2020 International Conference on Information and Communication Technology Convergence (ICTC) Pub Date : 2020-10-21 DOI:10.1109/ICTC49870.2020.9289268

Inseon Kim, Hong‐Yeop Song

{"title":"周长至少为8的短长度QC-LDPC码的简单构造","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":"{\"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}","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

摘要

本文提出了一种周长至少为8的拟循环低密度校验码的简单构造方法，方法是在大小为素数p = t2+1的有限域上选取3行连续的方基矩阵，并对长度为1200和2400的码进行蒙特卡罗模拟。

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

查看原文本刊更多论文

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

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.

求助全文

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

来源期刊

2020 International Conference on Information and Communication Technology Convergence (ICTC)

自引率

0.00%

发文量