On the error-correcting capability of LDPC codes
Kamil Sh. Zigangirov, A. E. Pusane, D. K. Zigangirov, Daniel J. Costello · Problems of Information Transmission · 2008
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.