Pseudo-Codewords of Cycle Codes via Zeta Functions

Details Pseudo-Codewords of Cycle Codes via Zeta Functions Pseudo-Codewords of Cycle Codes via Zeta Functions

2005-02-06

arxiv.org/abs/cs/0502033v1

Computer Science

Information Theory

Presented at Information Theory Workshop (ITW), San Antonio, TX, 2004

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pseudo-Codewords of Cycle Codes via Zeta Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pseudo-Codewords of Cycle Codes via Zeta Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudo-Codewords of Cycle Codes via Zeta Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-205211