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

Inseon Kim, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationICTC 2020 - 11th International Conference on ICT Convergence
Subtitle of host publicationData, Network, and AI in the Age of Untact
PublisherIEEE Computer Society
Pages1462-1465
Number of pages4
ISBN (Electronic)9781728167589
DOIs
Publication statusPublished - 2020 Oct 21
Event11th International Conference on Information and Communication Technology Convergence, ICTC 2020 - Jeju Island, Korea, Republic of
Duration: 2020 Oct 212020 Oct 23

Publication series

NameInternational Conference on ICT Convergence
Volume2020-October
ISSN (Print)2162-1233
ISSN (Electronic)2162-1241

Conference

Conference11th International Conference on Information and Communication Technology Convergence, ICTC 2020
Country/TerritoryKorea, Republic of
CityJeju Island
Period20/10/2120/10/23

Bibliographical note

Funding Information:
This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. 2020R1A2C201196911).

Publisher Copyright:
© 2020 IEEE.

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A simple construction for QC-LDPC codes of short lengths with girth at least 8'. Together they form a unique fingerprint.

Cite this