Pseudo-codewords of cycle codes via zeta functions

Ralf Koetter, Wen-ching Winnie Li, Pascal O. Vontobel, Judy L. Walker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

Cycle codes are a special case of low-density parity-check (LDPC) codes and as such can be decoded using an iterative message-passing decoding algorithm on the associated Tanner graph. The existence of pseudo-codewords is known to cause the decoding algorithm to fail in certain instances. In this paper, we draw a connection between pseudo-codewords of cycle codes and the so-called edge zeta function of the associated normal graph and show how the Newton polytope of the zeta function equals the fundamental cone of the code, which plays a crucial role in characterizing the performance of iterative decoding algorithms.

Original languageEnglish (US)
Title of host publication2004 IEEE Information Theory Workshop - Proceedings, ITW
Pages7-12
Number of pages6
StatePublished - Dec 1 2004
Event2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States
Duration: Oct 24 2004Oct 29 2004

Publication series

Name2004 IEEE Information Theory Workshop - Proceedings, ITW

Other

Other2004 IEEE Information Theory Workshop - Proceedings, ITW
CountryUnited States
CitySan Antonio, TX
Period10/24/0410/29/04

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Pseudo-codewords of cycle codes via zeta functions'. Together they form a unique fingerprint.

  • Cite this

    Koetter, R., Li, W. W., Vontobel, P. O., & Walker, J. L. (2004). Pseudo-codewords of cycle codes via zeta functions. In 2004 IEEE Information Theory Workshop - Proceedings, ITW (pp. 7-12). (2004 IEEE Information Theory Workshop - Proceedings, ITW).