On the error-correcting capability of LDPC codes

Authors:
K. Sh. Zigangirov;A. E. Pusane;D. K. Zigangirov;D. J. Costello, Jr.
Affiliations:
Institute for Information Transmission Problems, Moscow, Russia;University of Notre Dame, Indiana, USA;Institute for Information Transmission Problems, Moscow, Russia;University of Notre Dame, Indiana, USA
Venue:
Problems of Information Transmission
Year:
2008

Citing 4
Cited 1

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

Problems of Information Transmission
Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel

Problems of Information Transmission
An analysis of the block error probability performance of iterative decoding

IEEE Transactions on Information Theory
Distance Bounds for an Ensemble of LDPC Convolutional Codes

IEEE Transactions on Information Theory

Analysis of the relation between properties of LDPC codes and the tanner graph

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the ensemble of low-density parity-check (LDPC) codes introduced by Gallager [1]. The Zyablov-Pinsker majority-logic iterative algorithm [2] for decoding LDPC codes is analyzed on the binary symmetric channel. An analytical lower bound on the error-correcting capability 驴 max that grows linearly in the code block length is obtained.