A new look at the generalized distributive law

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1132-1155

  Pakzad, Payam ^a   Anantharam, Venkat ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Belief propagation; Conditional independence; Generalized distributive law (GDL); Graphical models; Iterative decoding; Junction tree; Signed measures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

BELIEF PROPAGATION; CONDITIONAL INDEPENDENCE; GENERALIZED DISTRIBUTIVE LAW; GRAPHICAL MODELS; ITERATIVE DECODING; JUNCTION TREE ALGORITHM; MEASURE THEORETIC VERSION; SIGNED MEASURES;

INFORMATION THEORY;

EID: 2942666109     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828058     Document Type: Article

References (14)

1. R. McEliece, D. MacKay, and J. Cheng, "Turbo decoding as an instance of pearl's 'belief propagation' algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 140-152, Feb. 1998.
2. D. MacKay and R. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding. 5th IMA Conf., Berlin, Germany: Sprilnger-Verlag, 1995, vol. 1025, pp. 100-111.
3. R. Cowell, A. Dawid, S. Lauritzen, and D. Spiegelhalter, Probabilistic Networks and Expert Systems. New York, NY: Springer-Verlag, 1999.
4. G. Shafer and P. Shenoy, "Probability propagation," Ann. Math. Artificial Intell., vol. 2, pp. 327-352, 1990.
5. S. Aji and R. McEliece, "The generalized distributive law," IEEE Trans. Inform. Theory, vol. 46, pp. 325-343. Mar. 2000.
6. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
7. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
8. F. Baccelli, G. Cohen, G. Olsder and J. Quadrat, Synchronization and Linearity. New York: Wiley, 1992.
9. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. New York: McGraw-Hill, 2001.
10. P. Pakzad and V. Anantharam. (2002) Conditional Independence for Signed Measures. [Online]. Available: http://inst.eecs.berkeley.edu/payamp/signedci.pdf
11. N. Zhang and D. Poole, "Exploiting causal independence in bayesian network inference," J. Artificial Intell. Res., vol. 5, pp. 301-328, 1996.
12. J. Walrand and P. Varaiya, High-Performance Communication Networks. San Francisco, CA: Morgan Kaufmann, 1996.
13. R. McEliece, "On the bcjr trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-192, July 1996.
14. J. Cohen and U. Rothblum, "Nonnegative ranks, decompositions, and factorization of nonnegative matrices," Linear Algebra Appl., vol. 190, pp. 149-168, 1993.