TY - GEN
T1 - Error bounds for repeat-accumulate codes decoded via linear programming
AU - Goldenberg, Idan
AU - Burshtein, David
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=78649250726&partnerID=8YFLogxK
U2 - 10.1109/ISTC.2010.5613869
DO - 10.1109/ISTC.2010.5613869
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:78649250726
SN - 9781424467457
T3 - 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
SP - 43
EP - 47
BT - 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
T2 - 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
Y2 - 6 September 2010 through 10 September 2010
ER -