Decoding Error-correcting Codes Via Linear Programming
Author | : Jon Feldman |
Publisher | : |
Total Pages | : 151 |
Release | : 2003 |
ISBN-10 | : OCLC:54907716 |
ISBN-13 | : |
Rating | : 4/5 (16 Downloads) |
Download or read book Decoding Error-correcting Codes Via Linear Programming written by Jon Feldman and published by . This book was released on 2003 with total page 151 pages. Available in PDF, EPUB and Kindle. Book excerpt: (Cont.) Our decoder is particularly attractive for analysis of these codes because the standard message-passing algorithms used for decoding are often difficult to analyze. For turbo codes, we give a relaxation very close to min-cost flow, and show that the success of the decoder depends on the costs in a certain residual graph. For the case of rate-1/2 repeat-accumulate codes (a certain type of turbo code), we give an inverse polynomial upper bound on the probability of decoding failure. For LDPC codes (or any binary linear code), we give a relaxation based on the factor graph representation of the code. We introduce the concept of fractional distance, which is a function of the relaxation, and show that LP decoding always corrects a number of errors up to half the fractional distance. We show that the fractional distance is exponential in the girth of the factor graph. Furthermore, we give an efficient algorithm to compute this fractional distance. We provide experiments showing that the performance of our decoders are comparable to the standard message-passing decoders. We also give new provably convergent message-passing decoders based on linear programming duality that have the ML certificate property.