Characterizations of Pseudo-Codewords of LDPC Codes

Details Characterizations of Pseudo-Codewords of LDPC Codes Characterizations of Pseudo-Codewords of LDPC Codes

2005-08-09

arxiv.org/abs/cs/0508049v3

Computer Science

Information Theory

Submitted, August 2005

Scientific paper

An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g. message passing algorithms and decoding based on linear programming, crucially depend on the efficient representation of a code in a graphical model. In order to understand the performance of these algorithms, we argue for the characterization of codes in terms of a so called fundamental cone in Euclidean space which is a function of a given parity check matrix of a code, rather than of the code itself. We give a number of properties of this fundamental cone derived from its connection to unramified covers of the graphical models on which the decoding algorithms operate. For the class of cycle codes, these developments naturally lead to a characterization of the fundamental polytope as the Newton polytope of the Hashimoto edge zeta function of the underlying graph.

Affiliated with

Also associated with

No associations

Rating

Characterizations of Pseudo-Codewords of LDPC Codes 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 Characterizations of Pseudo-Codewords of LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizations of Pseudo-Codewords of LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-576491