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.
No takes yet. Share an insight, caveat, or question.
Barg et al. (2002) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: