Non binary LDPC codes over the binary erasure channel: Density evolution analysis
暂无分享,去创建一个
[1] Rüdiger L. Urbanke,et al. Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes , 2005, ArXiv.
[2] Nenad Miladinovic,et al. Generalized LDPC codes and generalized stopping sets , 2008, IEEE Transactions on Communications.
[3] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[4] Valentin Savin,et al. Min-Max decoding for non binary LDPC codes , 2008, 2008 IEEE International Symposium on Information Theory.
[5] Vishwambhar Rathi,et al. Conditional entropy of non-binary LDPC codes over the BEC , 2008, 2008 IEEE International Symposium on Information Theory.
[6] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[7] David Declercq,et al. Extended minsum algorithm for decoding LDPC codes over GF(/sub q/ , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[8] Marco Chiani,et al. Analysis of Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel , 2006 .
[9] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[10] Marco Chiani,et al. Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes , 2007, 2007 IEEE International Symposium on Information Theory.
[11] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[12] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[13] Michael Luby,et al. LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..