Pakzad P, Anantharam V. (2005). Estimation and marginalization using the Kikuchi approximation methods. Neural computation. 17 [PubMed]

See more from authors: Pakzad P · Anantharam V

References and models cited by this paper

Aji S, Mceliece R. (2000). The generalized distributive law IEEE Trans Inform Theory. 46

Aji S, Mceliece R. (2001). The generalized distributive law and free energy minimization The generalized distributive law and free energy minimization.

Berrou C, Glavieux A, Thitimajshima P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes Proc IEEE Int Conf Comm. 2

Cover TM, Thomas JA. (1991). Elements of Information Theory.

Federer H. (1969). Geometric measure theory.

Gallager R. (1963). Low-density parity-check codes.

Hall P. (1935). On representatives of subsets J Lond Math Soc. 10

Jin H, Mceliece R, Divsalar D. (1998). Coding theorems for turbo-like codes Proceedings of the Allerton Conference on Communication, Control, and Computing.

Kikuchi R. (1951). A theory of cooperative phenomena Phys Rev. 6

Kittel C, Kroemer H. (1980). Thermal physics.

Lauritzen S, Cowell R, Dawid A, Spiegelhalter D. (1999). Probabilistic networks and expert systems.

Luby M. (2002). LT-codes Proceedings of IEEE Symposium on the Foundations of Computer Science.

Mackay D, Mceliece R, Cheng J. (1998). Turbo decoding as an instance of Pearl's belief propagation algorithm IEEE J Select Areas Commun. 16

Mackay D, Neal R. (1995). Good codes based on very sparse matrices Cryptography and Coding: 5th IMA Conference.

Mceliece R, Yildrim M. (2003). Belief propagation on partially ordered sets Mathematical systems theory in biology, communications, computation, and finance.

Morita T. (1994). Formal structure of the cluster variation method Prog Theor Phys Supp. 115

Pakzad P. (2004). Low complexity, high performance algorithms for estimation and decoding Unpublished doctoral dissertation.

Pakzad P, Anantharam V. (2002). Belief propagation and statistical physics Conference on Information Sciences and Systems (CISS 2002).

Pakzad P, Anantharam V. (2002). Minimal graphical representations of Kikuchi regions Proceedings of the Allerton Conference on Communication, Control, and Computing.

Pakzad P, Anantharam V. (2004). A new look at the generalized distributive law IEEE Trans Inform Theory. 50

Pearl J. (1988). Probabilistic reasoning in intelligent systems.

Richardson T. (2000). The geometry of turbo-decoding dynamics IEEE Trans Inform Theory. 46

Richardson T, Shokrollahi A, Urbanke R. (2001). Design of capacity-approaching irregular low-density parity-check codes IEEE Trans Inform Theory. 47

Richardson T, Urbanke R. (2001). The capacity of low-density parity-check codes under message-passing decoding IEEE Trans Inform Theory. 47

Stanley R. (1986). Enumerative combinatorics. 1

Tanner R. (1981). A recursive approach to low complexity codes IEEE Trans Inform Theory. 27

Teh Y, Welling M. (2001). Belief optimization for binary networks: A stable alternative to loopy belief propagation Proceedings of the International Conference on Uncertainty in Artificial Intelligence.

Wainwright M, Jordan M. (2003). Graphical models, exponential families, and variational inference Tech Rep 649.

Walrand J, Varaiya P. (1996). High-performance communication networks.

Weiss Y. (2000). Correctness of local probability in graphical models with loops. Neural computation. 12 [PubMed]

Weiss Y, Yedidia J, Freeman W. (2001). Bethe free energy, Kikuchi approximations, and belief propagation algorithms Tech. Rep. TR2001-16.

Weiss Y, Yedidia J, Freeman W. (2002). Constructing free energy approximations and generalized belief propagation algorithms Tech. Rep. TR2002-35.

Wicker S. (1995). Error control systems for digital communication and storage.

Yuille AL. (2002). CCCP algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation. Neural computation. 14 [PubMed]

References and models that cite this paper
This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.