Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A
暂无分享,去创建一个
[1] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .
[2] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[3] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[4] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[5] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[6] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[7] Daniel A. Spielman,et al. Practical loss-resilient codes , 1997, STOC '97.
[8] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.