Fountain codes with message passing and maximum likelihood decoding over erasure channels
暂无分享,去创建一个
[1] Marco Chiani,et al. Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC , 2008, 2008 4th Advanced Satellite Mobile Systems.
[2] Vincent Roca,et al. Improving the Decoding of LDPC Codes for the Packet Erasure Channel with a Hybrid Zyablov Iterative Decoding/Gaussian Elimination Scheme , 2008 .
[3] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[4] Ajay Dholakia,et al. Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[5] Amin Shokrollahi,et al. LDPC Codes: An Introduction , 2004 .
[6] Sae-Young Chung,et al. An efficient algorithm for ML decoding of raptor codes over the binary erasure channel , 2008, IEEE Communications Letters.
[7] Edgar Martínez-Moro,et al. An Introduction to LDPC Codes , 2013 .
[8] Harry Leib,et al. Fixed-Rate Raptor Codes Over Rician Fading Channels , 2008, IEEE Transactions on Vehicular Technology.
[9] Joong Bum Rhim,et al. Fountain Codes , 2010 .
[10] Michael Luby,et al. LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[11] Marco Chiani,et al. Performance versus overhead for fountain codes over Fq , 2010, IEEE Communications Letters.
[12] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.