Joint Iterative Decoding of LDPC Codes and Channels with Memory

[1]  Christian Schlegel,et al.  Low-Density Parity-Check Codes , 2004 .

[2]  Xiao Ma,et al.  Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds , 2003, IEEE Transactions on Information Theory.

[3]  Aleksandar Kavcic,et al.  Optimized LDPC codes for partial response channels , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Paul H. Siegel,et al.  Joint message-passing decoding of LDPC Codes and partial-response channels , 2002, IEEE Trans. Inf. Theory.

[5]  Paul H. Siegel,et al.  Multilevel coding with low-density parity-check component codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[7]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[8]  V. Sharma,et al.  Entropy and channel capacity in the regenerative setup with applications to Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[11]  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.

[12]  S. Brink.  Rate one-half code for approaching the Shannon limit by 0.1 dB , 2000 .

[13]  Amin Shokrollahi,et al.  New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity , 1999, AAECC.

[14]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[15]  Alain Glavieux,et al.  Iterative correction of intersymbol interference: Turbo-equalization , 1995, Eur. Trans. Telecommun..

[16]  F. Jelinek,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[17]  M. Shokrollahi,et al.  Capacity-achieving sequences , 2001 .

[18]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.