Pseudo-codewords of cycle codes via zeta functions

2004 IEEE Information Theory Workshop - Proceedings, ITW

Volumn , Issue , 2004, Pages 7-12

  Koetter, Ralf ^a   Li, Wen Ching W ^b   Vontobel, Pascal O ^a,d   Walker, Judy L ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^d University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEWORDS; CYCLE CODES; LOW DENSITY PARITY CHECK (LDPC) CODES; ZETA FUNCTIONS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; FUNCTIONS; MATRIX ALGEBRA; SECURITY OF DATA; SET THEORY; SIGNAL RECEIVERS; THEOREM PROVING;

BINARY CODES;

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

References (11)

1. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. on Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
2. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Intern. Conf. on Turbo Codes and Related Topics, (Brest, Prance), pp. 75-82, Sept. 1-5 2003. Available online under http://www.ifp.uiuc.edu/~vontobel.
3. J. Feldman, D. R. Karger, and M. J. Wainwright, "LP decoding," in Proc. 41st Allerton Conf. on Communications, Control, and Computing, (Allerton House, Monticello, Illinois, USA), October 1-3 2003. Available online under http://www.columbia.edu/~jf2189/pubs.html.
4. N. Wiberg, "Codes and Decoding on General Graphs", Linköping Studies in Science and Technology, Ph.D thesis No. 440, Linköping, Sweden, http://www.it.isy.liu.se/publikationer/LIU-TEK-THESIS-440.pdf.
5. F. R. Kschischang, B. J. Prey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. on Inform. Theory, vol. IT-47, no. 2, pp. 498-519, 2001.
6. S. L. Hakimi and J. Bredeson, "Graph-theoretic error correcting codes," IEEE Trans. on Inform. Theory, vol. IT-14, no. 4, pp. 584-591, 1968.
7. G. D. Forney, Jr., "Codes on graphs: normal realizations," IEEE Trans. on Inform. Theory, vol. 47, no. 2, pp. 520-548, 2001.
8. W. S. Massey, Algebraic Topology: an Introduction. New York: Springer-Verlag, 1977. Reprint of the 1967 edition, Graduate Texts in Mathematics, Vol. 56.
9. H. M. Stark and A. A. Terras, "Zeta functions of finite graphs and coverings," Adv. Math., vol. 121, no. 1, pp. 124-165, 1996.
10. D. B. West, Introduction to graph theory. Upper Saddle River, NJ: Prentice Hall Inc., 1996.
11. K. Hashimoto, "Zeta functions of finite graphs and representations of p-adic groups," in Automorphic forms and geometry of arithmetic varieties, vol. 15 of Adv. Stud. Pure Math., pp. 211-280, Boston, MA: Academic Press, 1989.