Skip to main content
SpringerLink
Log in

An Introduction to Low-Density Parity-Check Codes

  • Chapter
  • First Online:
Theoretical Aspects of Computer Science (TACSci 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2292))

Included in the following conference series:

Abstract

In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasure channel. We will also give an application of these methods to reliable content delivery.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bazzi, T. Richardson, and R. Urbanke. Exact thresholds and optimal codes for the binary symmetric channel and Gallager’s decoding algorithm A. IEEE Trans. Inform. Theory, 2001. Submitted.

    Google Scholar 

  2. E.R. Berlekamp, R.J. McEliece, and H.C.A. van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, 24:384–386, 1978.

    Article  MATH  Google Scholar 

  3. C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit errorcorrecting coding and decoding. In Proceedings of ICC’93, pages 1064–1070, Geneva, Switzerland, May 1993.

    Google Scholar 

  4. S-Y. Chung, D. Forney, T. Richardson, and R. Urbanke. On the design of lowdensity parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commu. Letters, 2001. To appear.

    Google Scholar 

  5. P. Elias. Coding for two noisy channels. In Information Theory, Third London Symposium, pages 61–76, 1955.

    Google Scholar 

  6. R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.

    Google Scholar 

  7. J.H. van Lint. Introduction to Coding Theory, volume 86 of Graduate Texts in Mathematics. Springer Verlag, third edition, 1998.

    Google Scholar 

  8. M. Luby, M. Mitzenmacher, and A. Shokrollahi. Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 364–373, 1998.

    Google Scholar 

  9. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman. Analysis of low density codes and improved designs using irregular graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 249–258, 1998.

    Google Scholar 

  10. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th annual ACM Symposium on Theory of Computing, pages 150–159, 1997.

    Google Scholar 

  11. D.J.C. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory, 45:399–431, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  12. G. A. Margulis. Explicit constructions of graphs without short cycles and low density codes. Combinatorica, 2:71–78, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  13. P. Oswald and A. Shokrollahi. Capacity-achieving sequences for the erasure channel. 2000. Manuscript.

    Google Scholar 

  14. T. Richardson, A. Shokrollahi, and R. Urbanke. Design of provably good lowdensity parity check codes. IEEE Trans. Inform. Theory (submitted), 1999.

    Google Scholar 

  15. T. Richardson and R. Urbanke. The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory (submitted), 1998.

    Google Scholar 

  16. T. Richardson and R. Urbanke. Efficient encoding of low-density parity-check codes. IEEE Trans. Inform. Theory, 2001. Submitted.

    Google Scholar 

  17. A. Shokrollahi. Newsequences of linear time erasure codes approaching the channel capacity. In M. Fossorier, H. Imai, S. Lin, and A. Poli, editors, Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, number 1719 in Lecture Notes in Computer Science, pages 65–76, 1999.

    Chapter  Google Scholar 

  18. A. Shokrollahi. Capacity-achieving sequences, volume 123 of IMA Volumes in Mathematics and its Applications, pages 153–166. 2000.

    MathSciNet  Google Scholar 

  19. M. Sipser and D. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42:1710–1722, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  20. D. Spielman. Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inform. Theory, 42:1723–1731, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  21. M. R. Tanner. A recursive approach to lowcomplexit y codes. IEEE Trans. Inform. Theory, 27:533–547, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  22. V. V. Zyablov. An estimate of the complexity of constructing binary linear cascade codes. Probl. Inform. Transm., 7:3–10, 1971.

    Google Scholar 

  23. V. V. Zyablov and M. S. Pinsker. Estimation of error-correction complexity of Gallager low-density codes. Probl. Inform. Transm., 11:18–28, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Digital Fountain, Inc., 39141 Civic Center Drive, 94538, Fremont, CA, USA

    Amin Shokrollahi

Authors
  1. Amin Shokrollahi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran

    Gholamreza B. Khosrovshahi

  2. Dept. of Mathematics & Computer Science, Drexel University, 19104, Philadelphia, PA, USA

    Ali Shokoufandeh

  3. Digital Fountain, Inc., 39151 Civic Center Drive, 94538, Fremont, CA, USA

    Amin Shokrollahi

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Shokrollahi, A. (2002). An Introduction to Low-Density Parity-Check Codes. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, A. (eds) Theoretical Aspects of Computer Science. TACSci 2000. Lecture Notes in Computer Science, vol 2292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45878-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45878-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43328-6

  • Online ISBN: 978-3-540-45878-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation