TY - GEN
T1 - Pseudo-codewords of cycle codes via zeta functions
AU - Koetter, Ralf
AU - Li, Wen-ching Winnie
AU - Vontobel, Pascal O.
AU - Walker, Judy L.
PY - 2004/12/1
Y1 - 2004/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=19544386094&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=19544386094&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:19544386094
SN - 0780387201
SN - 9780780387201
T3 - 2004 IEEE Information Theory Workshop - Proceedings, ITW
SP - 7
EP - 12
BT - 2004 IEEE Information Theory Workshop - Proceedings, ITW
T2 - 2004 IEEE Information Theory Workshop - Proceedings, ITW
Y2 - 24 October 2004 through 29 October 2004
ER -