Pseudo-Codewords of Cycle Codes via Zeta Functions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 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.
Presented at Information Theory Workshop (ITW), San Antonio, TX, 2004

Keywords

Information Theory, E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134199

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0502033
 http://arxiv.org/abs/cs/0502033

Collections

arXiv