论文信息 - On the error-correcting capability of LDPC codes

On the error-correcting capability of LDPC codes

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.

[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2] Michael Lentmaier,et al. On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices , 2005, Probl. Inf. Transm..

[3] Michael Lentmaier,et al. Distance Bounds for an Ensemble of LDPC Convolutional Codes , 2007, IEEE Transactions on Information Theory.

[4] Michael Lentmaier,et al. An analysis of the block error probability performance of iterative decoding , 2005, IEEE Transactions on Information Theory.

[5] Dmitri K. Zigangirov,et al. Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel , 2006, Probl. Inf. Transm..