Efficiently encodable irregular QC-LDPC codes constructed from self-reciprocal generator polynomials of MDS codes

Authors:
Norifumi Kamiya
Affiliations:
Information and Media Processing Laboratories, NEC Corporation, Kawasaki, Kanagawa, Japan
Venue:
IEEE Communications Letters
Year:
2010

Citing 6
Cited 0

Efficient encoding of QC-LDPC codes related to cyclic MDS codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A class of QC-LDPC codes with low encoding complexity and good error performance

IEEE Communications Letters
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Quasi-cyclic LDPC codes for fast encoding

IEEE Transactions on Information Theory
Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking

IEEE Transactions on Information Theory
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This letter presents a class of quasi-cyclic (QC) low-density parity-check (LDPC) codes which are effidently encodable and have better memory efficiency than other randomly constructed QC-LDPC codes. The parity-check matrix of the codes is obtained from a block circulant matrix that is generated from a self-reciprocal generator polynomial of a maximum distance separable (MDS) code by replacing some of its block entries by all zero matrices. We show by simulations that the codes can achieve excellent error performance.