Title :
Error exponents of expander codes
Author :
Barg, Alexander ; Zémor, Gilles
Author_Institution :
Bell Labs., Lucent Technol., Murray Hill, NJ, USA
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 0 and channel capacity. The decoding complexity grows linearly with code length
Keywords :
channel capacity; codes; computational complexity; error statistics; iterative decoding; binary symmetric channel; channel capacity; code length; decoding complexity; error exponents; error probability; expander codes; iterative decoding; positive exponent; Bipartite graph; Circuits; Decoding; Entropy; Error correction; Error correction codes; Error probability; Graph theory; Linear code; Vectors;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935910
