Combinatorial Construction of Low-Density Parity-Check Codes for Short Block Length and High Rate Applications
暂无分享,去创建一个
Changyong Pan | Jian Song | Jun Wang | Zhixing Yang | Suquan Ding | Jian Song | Zhixing Yang | Changyong Pan | Suquan Ding | Jun Wang
[1] Shu Lin,et al. Codes on finite geometries , 2005, IEEE Transactions on Information Theory.
[2] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[3] D. Mackay,et al. Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .
[4] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[5] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[6] Bahram Honary,et al. Construction of low-density parity-check codes based on balanced incomplete block designs , 2004, IEEE Transactions on Information Theory.
[7] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[8] Luther D. Rudolph,et al. A class of majority logic decodable codes (Corresp.) , 1967, IEEE Trans. Inf. Theory.
[9] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.
[10] Shu Lin,et al. On the construction of a class of majority-logic decodable codes , 1971, IEEE Trans. Inf. Theory.
[11] Bane V. Vasic,et al. Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.
[12] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[13] 大西 仁,et al. Pearl, J. (1988, second printing 1991). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann. , 1994 .