Construction of low-density parity-check codes based on balanced incomplete block designs

Authors:
B. Ammar;B. Honary;Yu Kou;Jun Xu;S. Lin
Affiliations:
Lancaster Univ., UK;-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2004

Citing 0
Cited 6

High rate LDPC codes using OFDM and equalisation techniques for WiMAX systems

ELECTRO'06 Proceedings of the 4th WSEAS International Conference on Electromagnetics, Wireless and Optical Communications
A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A lattice-based systematic recursive construction of quasi-cyclic LDPC codes

IEEE Transactions on Communications
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
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 a method for constructing structured regular low-density parity-check (LDPC) codes based on a special type of combinatoric designs, known as balance incomplete block designs. Codes constructed by this method have girths at least 6 and they perform well with iterative decoding. Furthermore, several classes of these codes are quasi-cyclic and hence their encoding can be implemented with simple feedback shift registers.