### 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 language | English (US) |
---|---|

Title of host publication | 2004 IEEE Information Theory Workshop - Proceedings, ITW |

Pages | 7-12 |

Number of pages | 6 |

State | Published - Dec 1 2004 |

Event | 2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States Duration: Oct 24 2004 → Oct 29 2004 |

### Publication series

Name | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|

### Other

Other | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|---|

Country | United States |

City | San Antonio, TX |

Period | 10/24/04 → 10/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

*2004 IEEE Information Theory Workshop - Proceedings, ITW*(pp. 7-12). (2004 IEEE Information Theory Workshop - Proceedings, ITW).