Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming
Information Theory
2010-02-22 v2 math.IT
Abstract
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.
Cite
@article{arxiv.0904.1692,
title = {Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming},
author = {Idan Goldenberg and David Burshtein},
journal= {arXiv preprint arXiv:0904.1692},
year = {2010}
}