Comparison of constructions of irregular Gallager codes
暂无分享,去创建一个
[1] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[2] M. Luby,et al. Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[3] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[4] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[5] David J. C. MacKay,et al. Good Codes Based on Very Sparse Matrices , 1995, IMACC.
[6] David J. C. MacKay,et al. Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.
[7] Frank R. Kschischang,et al. Gallager codes for CDMA applications. II. Implementations, complexity, and system capacity , 2000, IEEE Trans. Commun..
[8] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[9] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..