DocumentCode
2730332
Title
Error bounds for repeat-accumulate codes decoded via linear programming
Author
Goldenberg, Idan ; Burshtein, David
Author_Institution
Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel
fYear
2010
fDate
6-10 Sept. 2010
Firstpage
43
Lastpage
47
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.
Keywords
decoding; interleaved codes; linear programming; memoryless systems; polynomials; probability; telecommunication channels; turbo codes; decoder; decoding error probability; error bound; interleaved code; inverse polynomial; irregular repeat-accumulate code; linear programming; memoryless binary-input output-symmetric channel; regular repeat-accumulate code;
fLanguage
English
Publisher
ieee
Conference_Titel
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
Conference_Location
Brest
Print_ISBN
978-1-4244-6744-0
Electronic_ISBN
978-1-4244-6745-7
Type
conf
DOI
10.1109/ISTC.2010.5613869
Filename
5613869
Link To Document