Feldman, J.
Karger, D.R.
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
This paper appears in: Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on Publication Date: 16-19 Nov. 2002
On page(s):
251
- 260
ISSN: 0272-5428
ISBN: 0-7695-1822-2
Digital Object Identifier: 10.1109/SFCS.2002.1181948
Current Version Published: 2003-02-28
Abstract
We introduce a novel algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of repeat-accumulate (RA) codes, under the binary symmetric channel with a certain constant threshold bound on the noise, the error probability of our algorithm is bounded by an inverse polynomial in the code length. Our linear program (LP) minimizes the distance between the received bits and binary variables representing the code bits. Our LP is based on a representation of the code where code words are paths through a graph. Consequently, the LP bears a strong resemblance to the min-cost flow LP. The error bounds are based on an analysis of the probability, over the random noise of the channel, that the optimum solution to the LP is the path corresponding to the original transmitted code word.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not
logged in.
Guests
may access Abstract records free of charge.
Cart
