Error exponents of expander codes
Alexander Barg, Gilles Zémor · IEEE Transactions on Information Theory · 2002
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.