Title :
Error exponents of expander codes
Author :
Barg, Alexander ; Zémor, Gilles
Author_Institution :
Lucent Technol. Bell Labs., Murray Hill, NJ, USA
fDate :
6/1/2002 12:00:00 AM
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
Keywords :
channel capacity; codes; error statistics; iterative decoding; binary-symmetric channel capacity; code length; code rate; decoding complexity; error exponents; error probability; expander codes; iterative decoding; large minimum distance; Binary codes; Channel capacity; Circuits; Concatenated codes; Entropy; Error correction codes; Error probability; Graph theory; Iterative algorithms; Iterative decoding;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.1003853
