Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming

Details Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming

2009-04-10

arxiv.org/abs/0904.1692v2

Computer Science

Information Theory

Scientific paper

We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a linear-programming based decoder which is an inverse polynomial in the block length. Our bound is valid for any memoryless, binary-input, output-symmetric (MBIOS) channel. This result generalizes the bound derived by Feldman et al., which was for regular RA(2) codes.

Affiliated with

Also associated with

No associations

Rating

Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming 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 Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674043