Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords

Details Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords

2011-02-18

arxiv.org/abs/1102.3902v2

Computer Science

Information Theory

6 pages, 2 figures, accepted for IEEE ISIT 2011

Scientific paper

We analyze Linear Programming (LP) decoding of graphical binary codes operating over soft-output, symmetric and log-concave channels. We show that the error-surface, separating domain of the correct decoding from domain of the erroneous decoding, is a polytope. We formulate the problem of finding the lowest-weight pseudo-codeword as a non-convex optimization (maximization of a convex function) over a polytope, with the cost function defined by the channel and the polytope defined by the structure of the code. This formulation suggests new provably convergent heuristics for finding the lowest weight pseudo-codewords improving in quality upon previously discussed. The algorithm performance is tested on the example of the Tanner [155, 64, 20] code over the Additive White Gaussian Noise (AWGN) channel.

Affiliated with

Also associated with

No associations

Rating

Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords 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 Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-158964