Connecting the Bethe entropy and the edge zeta function of a cycle code

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 704-708

  Vontobel, Pascal O ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEWORD; CYCLE CODES; DIRECTIONAL DERIVATIVE; ENTROPY RATES; MARGINALS; OBJECT OF INTERESTS; RANDOM WALK; TAYLOR SERIES EXPANSIONS; ZETA FUNCTION;

INFORMATION THEORY; TAYLOR SERIES;

ENTROPY;

EID: 77955707425     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513594     Document Type: Conference Paper

References (17)

1. J. S. Yedidia, W. T. Freeman, and Y. Weiss, "Constructing free-energy approximations and generalized belief propagation algorithms," IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2282-2312, Jul. 2005.
2. M. J. Wainwright and M. I. Jordan, Graphical models, exponential families, and variational inference. Technical Report No. 649, Dept. of Statistics, UC Berkeley, Berkeley, CA, USA, 2003.
3. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Intern. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 1-5 2003, pp. 75-82.
4. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," accepted for IEEE Trans. Inform. Theory, available online under http://www.arxiv.org/abs/cs.IT/0512078, 2007.
5. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 2003.
6. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005.
7. J. Bredeson and S. L. Hakimi, "Decoding of graph theoretic codes," IEEE Trans. Inf. Theory, vol. 13, no. 2, pp. 348-349, Apr. 1967.
8. S. L. Hakimi and J. Bredeson, "Graph-theoretic error correcting codes," IEEE Trans. Inf. Theory, vol. 14, no. 4, pp. 584-591, Jul. 1968.
9. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981.
10. H. M. Stark and A. A. Terras, "Zeta functions of finite graphs and coverings," Adv. in Math., vol. 121, no. 1, pp. 124-165, 1996.
11. R. Koetter, W.-C. W. Li, P. O. Vontobel, and J. L. Walker, "Characterizations of pseudo-codewords of (low-density) parity-check codes," Adv. in Math., vol. 213, no. 1, pp. 205-229, Aug. 2007.
12. P. O. Vontobel, "Connecting the Bethe entropy and the edge zeta function of a cycle code," in preparation, to be submitted to IEEE Trans. Inf. Theory, Apr. 2010.
13. Y. Watanabe and K. Fukumizu, "Graph zeta function in the Bethe free energy and loopy belief propagation," in Proc. Neural Information Processing Systems Conference, Vancouver, Canada, Dec. 7-12 2009.
14. G. D. Forney, Jr., "Codes on graphs: normal realizations," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.
15. P. O. Vontobel, "Symbolwise graph-cover decoding: connecting sum-product algorithm decoding and Bethe free energy minimization," in Proc. 46th Allerton Conf. on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sept. 23-26 2008, slides available at http://www.pseudocodewords.info.
16. K. Hashimoto, "Zeta functions of finite graphs and representations of p-adic groups," in Automorphic forms and geometry of arithmetic varieties, ser. Adv. Stud. Pure Math. Boston, MA: Academic Press, 1989, vol. 15, pp. 211-280.
17. P. O. Vontobel, "A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization," in Proc. Information Theory and Applications Workshop, UC San Diego, La Jolla, CA, USA, Jan. 31-Feb. 5 2010.