Pseudo-Codewords of Cycle Codes via Zeta Functions

Simple item page
dc.creatorKoetter, Ralf
dc.creatorLi, Wen-Ching W.
dc.creatorVontobel, Pascal O.
dc.creatorWalker, Judy L.
dc.date2005-02-06
dc.date.accessioned2026-07-07T08:17:45Z
dc.date.available2026-07-07T08:17:45Z
dc.descriptionCycle 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 polyhedron of the zeta function equals the fundamental cone of the code, which plays a crucial role in characterizing the performance of iterative decoding algorithms.
dc.descriptionPresented at Information Theory Workshop (ITW), San Antonio, TX, 2004
dc.identifierhttps://arxiv.org/abs/cs/0502033
dc.identifierhttp://arxiv.org/abs/cs/0502033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134199
dc.subjectInformation Theory
dc.subjectE.4
dc.titlePseudo-Codewords of Cycle Codes via Zeta Functions
dc.typetext

Files

Collections

arXiv