SpringerLink
Log in

Expander codes

The Sipser-Spielman construction

  • General Article
  • Published:
Resonance Aims and scope Submit manuscript

Abstract

Expander graphs are graphs in which every set of vertices has an unusually large number of neighbours. It is a remarkable fact that graphs of this kind exist. Even more remarkable is the spectrum of applications of these graphs, ranging from providing new insights in the field of computational complexity theory to the solution of problems in communication. In this article we show how expander graphs can be used for designing efficient error correcting codes which have fast decoding algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Suggested Reading

  1. Stephen B Wicker and Saejoon Kim,Fundamentals of Codes, Graphs,and Iterative Decoding, Kluwer Academic Publishers, 2003.

  2. M Sipser and D Spielman, Expander codes,IEEE Transactions on Information Theory, Vol.42, No.6, pp.1710–1722, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automation, Indian Institute of Science, 560 012, Bangalore, India

    Priti Shankar

Authors
  1. Priti Shankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Priti Shankar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shankar, P. Expander codes. Reson 10, 25–40 (2005). https://doi.org/10.1007/BF02835890

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02835890

Keywords

Search

Navigation