On algebraic construction of Gallager and circulant low-density parity-check codes

Authors:
Heng Tang;Jun Xu;Yu Kou;S. Lin;K. Abdel-Ghaffar
Affiliations:
PMC-Sierra Inc., Portland, OR, USA;-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2004

Citing 0
Cited 8

Codes from zero-divisors and units in group rings

International Journal of Information and Coding Theory
LDPC codes from Singer cycles

Discrete Applied Mathematics
Geometrically-structured maximum-girth LDPC block and convolutional codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A lattice-based systematic recursive construction of quasi-cyclic LDPC codes

IEEE Transactions on Communications
Algebraic constructions of LDPC codes with no short cycles

International Journal of Information and Coding Theory
Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares

IEEE Transactions on Communications
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
New constructions of quasi-cyclic LDPC codes based on two classes of balanced incomplete block designs: for AWGN and binary erasure channels

AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	754.84

Visualization

Abstract

This correspondence presents three algebraic methods for constructing low-density parity-check (LDPC) codes. These methods are based on the structural properties of finite geometries. The first method gives a class of Gallager codes and a class of complementary Gallager codes. The second method results in two classes of circulant-LDPC codes, one in cyclic form and the other in quasi-cyclic form. The third method is a two-step hybrid method. Codes in these classes have a wide range of rates and minimum distances, and they perform well with iterative decoding.