Novel Algebraic Constructions of Nonbinary Structured LDPC Codes over Finite Fields
暂无分享,去创建一个
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] D. Declercq,et al. Fast Decoding Algorithm for LDPC over GF(2q) , 2003 .
[3] Shu Lin,et al. High Performance Nonbinary Quasi-Cyclic LDPC Codes on Euclidean Geometries , 2007, MILCOM 2007 - IEEE Military Communications Conference.
[4] D. Mackay,et al. Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).
[5] Shu Lin,et al. Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.
[6] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[7] Zongwang Li,et al. Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..
[8] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.
[9] M. Flanagan,et al. A Euclidean Geometry Based Algebraic Construction Technique for Girth-8 Gallager LDPC Codes , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.
[10] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .