Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

DOI10.1109/TIT.2007.896873MaRDI QIDQ3548176zbMATH OpenFDO

Authors Henry David Pfister, Igal Sason

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Abstract: The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {em bounded complexity}, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of capacity-achieving ensembles for the BEC with bounded complexity. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving ensembles of codes defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of LDPC and IRA codes. The ARA codes also have the advantage of being systematic.

Recommendations

• Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
• Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
• scientific article; zbMATH DE number 1504647
• Publication:4502612
• Capacity-achieving sequences for the erasure channel

Cited in

(6)

• Achievable complexity-performance tradeoffs in lossy compression
• Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
• Design Methods for Irregular Repeat–Accumulate Codes
• Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
• Weighted Nonbinary Repeat–Accumulate Codes
• scientific article; zbMATH DE number 1504647 (Why is no real title available?)

This page was built for publication: Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

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