TP decoding

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 1, Issue , 2007, Pages 322-329

  Lu, Yi ^a   Méasson, Cyril ^b   Montanari, Andrea ^c  

^a Stanford University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY TREES; DECODING; FORESTRY; INFERENCE ENGINES; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION;

BELIEF PROPAGATION; COMPUTATION TREES; COUNTING INDEPENDENT SETS; MARKOV RANDOM FIELDS; MAXIMUM A POSTERIORI DECODING; ORIGINAL ALGORITHMS; PROBABILISTIC INFERENCE; TREE PRUNING;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTATION; PRUNING; TREES;

EID: 84940644972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. T. Richardson and r. Urbanke, Modern Coding Theory, draft available at http://lthcwww.epf1.ch/index.php
2. D. Weitz, "Counting independent sets up to the tree threshold," Proc. 38th ACM Symp. on Theory of Comp., Seattle, May 2006
3. T. Richardson, "Error floors of LDPC codes," Proc. 41st Allerton Conf. on Comm., Contr., and Computing. Monticello, IL, 2003
4. C. Nair and P. Tetali, "The correlation decay (CD) tree and strong spatial mixing in multi-spin systems," arXiv:math/07 014 94v3, 2007
5. K. Jung and D. Shah, "Inference in Binary Pair-wise Markov Random Fields through Self-Avoiding Walks," arXiv: cs/061011 lv2, 2006
6. E. Mossel and A. Sly, "Rapid Mixing of Gibbs Sampling on Graphs that are Sparse on Average," arXiv: 0704.3 603, 2007
7. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996
8. G. Battail, M. Decouvelaere, and P. Godlewski, "Replication decoding," IEEE Trans. Inform. Theory, vol. 25, pp. 332-345, May 1979
9. C. Hartmann and L. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes," IEEE Trans. Inform. Theory, vol. 22, pp. 514-517, Sept. 1976
10. J. B. Anderson and S. M. Hladik, "Tailbiting MAP decoders," IEEE Journal on selected areas in communications, vol. 16, no. 2, pp. 297-302, Feb. 1998
11. A. Montanari, "Two Lectures on Coding Theory and Statistical Mechanics," in Mathematical Statistical Physics: Lecture Notes of the Les Houches Summer School 2005, A. Bovier editor, Elsevier 2006
12. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996
13. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 49, pp. 1611-1635, July 2003
14. G. Grimmett, Percolation, Springer, New York, 1999