Algebraic construction of quasi-cyclic LDPC codes – part II: for AWGN and binary random and burst erasure channels

Authors:
Ying Y. Tai;Lingqi Zeng;Lan Lan;Shumei Song;Shu Lin;Khaled Abdel-Ghaffar
Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA
Venue:
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2006

Citing 3
Cited 3

Algebraic constructions of quasi-cyclic LDPC codes – part I: for AWGN and binary random erasure channels

AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Design of capacity-approaching irregular low-density parity-check codes

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

IEEE Transactions on Information Theory

Hybrid burst erasure correction of LDPC codes

IEEE Communications Letters
Construction of near-optimum burst erasure correcting low-density parity-check codes

IEEE Transactions on Communications
Burst decoding of cyclic codes based on circulant parity-check matrices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

This paper is the second part of a sequence of two papers that present several algebraic methods for constructing quasi-cyclic (QC) LDPC codes for AWGN, binary random and burst erasure channels. In the first paper, we presented a class of QC-LDPC codes for both the AWGN and binary random erasure channels. The construction of this class of QC-LDPC codes is based on finite fields and location vector representations of finite field elements. In this paper, we presented two other algebraic methods for constructing QC-LDPC codes for the AWGN, binary random and burst erasure channels.