论文信息 - Two approaches to the analysis of low-density parity-check codes

Two approaches to the analysis of low-density parity-check codes

We overview two approaches to the analysis of low-density parity-check (LDPC) codes: selected code approach and ensemble approach. As examples of application of the methods we consider Gallager's homogeneous LDPC codes and Berrou-Glavieux-Thitimajshima (BGT) turbo-codes.

[1] Michael Lentmaier,et al. Mathematical analysis of an iterative algorithm for low-density code decoding , 2000 .

[2] Michael Lentmaier,et al. Some Results Concerning the Design and Decoding of Turbo-Codes , 2001, Probl. Inf. Transm..

[3] Marco Breiling,et al. A logarithmic upper bound on the minimum distance of turbo codes , 2004, IEEE Transactions on Information Theory.

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

[5] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[6] Michael Lentmaier,et al. To the Theory of Low-Density Convolutional Codes. II , 2001, Probl. Inf. Transm..