This article is cited in 11 papers

Coding Theory

On the Error-Correcting Capability of LDPC Codes

K. Sh. Zigangirov^a, A. E. Pusane^b, D. K. Zinangirov^a, D. J. Costello<sup>b

a</sup> Institute for Information Transmission Problems, Russian Academy of Sciences
^b University of Notre Dame

Abstract: We consider the ensemble of low-density parity-check (LDPC) codes introduced by Gallager [Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963]. 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 $\tau_{\max}$ that grows linearly in the code block length is obtained.

UDC: 621.391.15

Received: 22.11.2007
Revised: 30.04.2008

 English version: Problems of Information Transmission, 2008, 44:3, 214–225

Bibliographic databases:

• 
• 
• 
•