New constructions of quasi-cyclic LDPC codes based on two classes of balanced incomplete block designs: for AWGN and binary erasure channels

Authors:
Lan Lan;Ying Yu Tai;Shu Lin;Behshad Memari;Bahram Honary
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 Communication Engineering, Lancaster University, Lancaster, UK;Department of Communication Engineering, Lancaster University, Lancaster, UK
Venue:
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2006

Citing 8
Cited 0

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Construction of low-density parity-check codes based on balanced incomplete block designs

IEEE Transactions on Information Theory
On algebraic construction of Gallager and circulant low-density parity-check codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper presents two new methods for constructing quasi-cyclic LDPC codes using certain special classes of balanced incomplete block designs constructed based on finite fields. The codes constructed perform well with iterative decoding over both AWGN and binary erasure channels.