Iterative Decoding of Low-Density Parity Check Codes

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely efficient (both in theory and practice).

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

[2]  Amin Shokrollahi,et al.  Capacity-achieving sequences for the erasure channel , 2002, IEEE Trans. Inf. Theory.

[3]  Rüdiger L. Urbanke,et al.  Parity-check density versus performance of binary linear block codes over memoryless symmetric channels , 2003, IEEE Transactions on Information Theory.

[4]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[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]  Venkatesan Guruswami,et al.  Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.

[7]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[8]  Venkatesan Guruswami,et al.  Linear time encodable and list decodable codes , 2003, STOC '03.

[9]  Noga Alon,et al.  A linear time erasure-resilient code with nearly optimal recovery , 1996, IEEE Trans. Inf. Theory.

[10]  Venkatesan Guruswami,et al.  Explicit capacity-achieving list-decodable codes , 2005, STOC.

[11]  Venkatesan Guruswami.  List Decoding in Average-Case Complexity and Pseudorandomness , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[12]  Venkatesan Guruswami,et al.  Guest column: error-correcting codes and expander graphs , 2004, SIGA.

[13]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[14]  Jon Feldman,et al.  LP decoding achieves capacity , 2005, SODA '05.

[15]  M. Aminshokrollahi.  New sequences of linear time erasure codes approaching the channel capacity , 1999 .

[16]  Rüdiger L. Urbanke,et al.  Capacity-achieving ensembles for the binary erasure channel with bounded complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[17]  D. Spielman,et al.  Expander codes , 1996 .

[18]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[19]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[20]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[21]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[22]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[23]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[24]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[25]  L. Bazzi,et al.  Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[26]  Madhu Sudan.  List decoding: algorithms and applications , 2000, SIGA.

[27]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[28]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[29]  Rüdiger L. Urbanke,et al.  Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel , 2004, IEEE Transactions on Information Theory.

[30]  Luca Trevisan,et al.  Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..