Skip to main content

Low Density Parity Check Codes

  • 1675 Accesses

Abstract

Besides the turbo codes, there is one more class of linear block codes that makes possible to approach to the Shannon bound. These are Low Density Parity Check (LDPC) codes. They were proposed by Gallager [83]. In principle they have a sparse parity - check matrix. In such a way the corresponding parity-check equations have a small number of terms providing significantly smaller complexity compared to standard linear block codes.

Keywords

  • Bipartite Graph
  • Code Rate
  • Code Word
  • Turbo Code
  • Variable Node

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-49370-1_9
  • Chapter length: 61 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   119.00
Price excludes VAT (USA)
  • ISBN: 978-3-319-49370-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   159.99
Price excludes VAT (USA)
Hardcover Book
USD   219.99
Price excludes VAT (USA)
Fig. 9.1
Fig. 9.2
Fig. 9.3
Fig. 9.4
Fig. 9.5
Fig. 9.6
Fig. 9.7
Fig. 9.8
Fig. 9.9
Fig. 9.10
Fig. 9.11
Fig. 9.12
Fig. 9.13
Fig. 9.14
Fig. 9.15
Fig. 9.16
Fig. 9.17
Fig. 9.18
Fig. 9.19
Fig. 9.20
Fig. 9.21
Fig. 9.22
Fig. 9.23
Fig. 9.24
Fig. 9.25
Fig. 9.26
Fig. 9.27

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Predrag Ivaniš .

Rights and permissions

Reprints and Permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Ivaniš, P., Drajić, D. (2017). Low Density Parity Check Codes. In: Information Theory and Coding - Solved Problems. Springer, Cham. https://doi.org/10.1007/978-3-319-49370-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49370-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49369-5

  • Online ISBN: 978-3-319-49370-1

  • eBook Packages: EngineeringEngineering (R0)