A Caltech Library Service

RA Codes Achieve AWGN Channel Capacity

Jin, Hui and McEliece, Robert J. (1999) RA Codes Achieve AWGN Channel Capacity. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science. No.1719. Springer , Berlin, pp. 10-18. ISBN 978-3-540-66723-0.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


In ref. [3] we introduced a simplified ensemble of serially concatenated “turbo-like” codes which we called repeat-accumulate, or RA codes. These codes are very easy to decode using an iterative decoding algorithm derived from belief propagation on the appropriate Tanner graph, yet their performance is scarcely inferior to that of full-fledged turbo codes. In this paper, we prove that on the AWGN channel, RA codes have the potential for achieving channel capacity. That is, as the rate of the RA code approaches zero, the average required bit E_b/N_0 for arbitrarily small error probability with maximum-likelihood decoding approaches log 2, which is the Shannon limit. In view of the extreme simplicity of RA codes, this result is both surprising and suggestive.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1999 Springer-Verlag Berlin Heidelberg. This work was supported by NSF grant no. CCR-9804793, and grants from Sony and Qualcomm.
Funding AgencyGrant Number
Sony CorporationUNSPECIFIED
Series Name:Lecture Notes in Computer Science
Issue or Number:1719
Record Number:CaltechAUTHORS:20200204-152225846
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:101119
Deposited By: Tony Diaz
Deposited On:04 Feb 2020 23:36
Last Modified:16 Nov 2021 17:59

Repository Staff Only: item control page