Error exponents of expander codes

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 2002 English Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Information Theory, volume 48, pages 1,725-1,729 (issn: 0018-9448,

Copyright policy )

Authors: Alexander Barg; Gilles Zémor;

doi: 10.1109/tit.2002.1003853 , 10.1109/isit.2001.935910

Error exponents of expander codes

- Summary
- Subjects
- Metrics

Abstract

Summary: 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.

Related Organizations

Keywords

Other types of codes, Analysis of algorithms and problem complexity, Decoding, Algorithmic information theory (Kolmogorov complexity, etc.)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	62
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%