A construction for girth‐8 QC‐LDPC codes using Golomb rulers

In this paper, an algebraic construction of regular QC‐LDPC codes by using the modular multiplication table mod P and Golomb rulers are proposed. It is proved that the proposed QC‐LDPC codes based on a Golomb ruler of length L have girth at least 8 if P>2L$P>2L$. The error performance of the p...

Full description

Saved in:
Bibliographic Details
Published inElectronics letters Vol. 58; no. 15; pp. 582 - 584
Main Authors Kim, Inseon, Song, Hong‐Yeop
Format Journal Article
LanguageEnglish
Published Stevenage John Wiley & Sons, Inc 01.07.2022
Wiley
Subjects
Codes
Coding theory
Construction
Error correcting codes
Guarantees
Low density parity check codes
Mathematical tables
Multiplication
Parity
Online AccessGet full text

Cover

More Information
Summary:In this paper, an algebraic construction of regular QC‐LDPC codes by using the modular multiplication table mod P and Golomb rulers are proposed. It is proved that the proposed QC‐LDPC codes based on a Golomb ruler of length L have girth at least 8 if P>2L$P>2L$. The error performance of the proposed QC‐LDPC codes are simulated with various Golomb rulers. The proposed codes of length around 300 from the optimal 6‐mark Golomb ruler have an additional coding gain of at least 0.1 dB over 5G NR LDPC codes, 0.5 dB over those given earlier by others, both at FER 10−3. Some non‐trivial techniques to increase the length of a given Golomb ruler with and without an additional mark for improving the performance of the codes from Golomb rulers up to 0.7 dB are also found.
ISSN:0013-5194
1350-911X
DOI:10.1049/ell2.12531