Error exponents of expander codes
Barg, A.
Zemor, G.
Lucent Technol. Bell Labs., Murray Hill, NJ;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jun 2002
Volume: 48,
Issue: 6
On page(s): 1725-1729
ISSN: 0018-9448
References Cited: 10
CODEN: IETTAW
INSPEC Accession Number: 7297403
Digital Object Identifier: 10.1109/TIT.2002.1003853
Current Version Published: 2002-08-07
Abstract
We show that expander codes attain the capacity of the
binary-symmetric channel under iterative decoding. The error probability
has a positive exponent for all rates between zero and the channel
capacity. The decoding complexity grows linearly with the code length
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
