Error bounds for repeat-accumulate codes decoded via linear programming

DOI10.3934/AMC.2011.5.555MaRDI QIDQ660079zbMATH OpenOpenAlexFDO

Authors Idan Goldenberg, David Burshtein

Publication date 25 January 2012

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0904.1692

zbMATH Keywords

coding theoryerror performancelinear-programming (LP) decodingrepeat-accumulate codesupper bound

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Decoding (94B35) Error probability in coding theory (94B70)

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.

Recommendations

• Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding
• Decoding turbo-like codes via linear programming
• scientific article; zbMATH DE number 1504647
• LP decoding achieves capacity
• LP Decoding Corrects a Constant Fraction of Errors

Cited in

(4)

• Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding
• Weighted Nonbinary Repeat–Accumulate Codes
• Optimization design of a class of generalized RA codes
• scientific article; zbMATH DE number 1504647 (Why is no real title available?)

This page was built for publication: Error bounds for repeat-accumulate codes decoded via linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660079)