A class of structured LDPC codes with large girth
暂无分享,去创建一个
Urs Niesen | José M. F. Moura | Jin Lu | Urs Niesen | Jin Lu
[1] X. Jin. Factor graphs and the Sum-Product Algorithm , 2002 .
[2] Jin Lu,et al. Turbo like decoding of LDPC codes , 2003, Digest of INTERMAG 2003. International Magnetics Conference (Cat. No.03CH37401).
[3] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[4] J. Moura,et al. Structured low-density parity-check codes , 2004, IEEE Signal Processing Magazine.
[5] R. M. Tanner. Spectral graphs for quasi-cyclic LDPC codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[6] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[7] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[8] Michael Horstein,et al. Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963) , 1964, IEEE Transactions on Information Theory.
[9] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[10] José M. F. Moura,et al. Turbo design for LDPC codes with large girth , 2003, 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications - SPAWC 2003 (IEEE Cat. No.03EX689).
[11] Li Ping,et al. Concatenated tree codes: A low-complexity, high-performance approach , 2001, IEEE Trans. Inf. Theory.