The distribution of loop lengths in graphical models for turbo decoding
暂无分享,去创建一个
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] C. Heegard,et al. Interleaver design methods for turbo codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[3] S. Dolinar,et al. Weight distributions for turbo codes using random and nonrandom permutations , 1995 .
[4] Brendan J. Frey,et al. Graphical Models for Machine Learning and Digital Communication , 1998 .
[5] Terrence J. Sejnowski,et al. Correctness of Local Probability Propagation in Graphical Models with Loops , 2001 .
[6] Michael I. Jordan,et al. Probabilistic Independence Networks for Hidden Markov Probability Models , 1997, Neural Computation.
[7] Stephen B. Wicker,et al. Turbo Coding , 1998 .
[8] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[9] David Eppstein,et al. The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding , 1999, ArXiv.
[10] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[11] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[12] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[13] Brendan J. Frey,et al. Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..
[14] Daniel A. Spielman,et al. Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.
[15] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[16] Yair Weiss,et al. Correctness of Local Probability Propagation in Graphical Models with Loops , 2000, Neural Computation.
[17] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .