Skip to main content

Error Correcting Codes Based on Probabilistic Decoding and Sparse Matrices

  • Chapter
  • First Online:
A Mathematical Approach to Research Problems of Science and Technology

Part of the book series: Mathematics for Industry ((MFI,volume 5))

  • 1846 Accesses

Abstract

These days we encounter many digital storage and communication devices in our daily lives. They contain error correcting codes that operate when data is read from storage devices or received via communication devices. For example, you can listen to music on a compact disc even if its surface is scratched. This article introduces low density parity check (LDPC) codes and the sum-product decoding algorithm. LDPC codes, one class of error correcting codes, have been used for practical applications such as hard disk drives and satellite digital broadcast systems because their performance closely approaches the theoretical limit with manageable computational complexity. In particular, it is shown that an optimal decoding algorithm from the viewpoint of probabilistic inference can be derived with LDPC codes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Sometimes called symbol MAP decoding to distinguish it from the MAP algorithm that maximizes the APP of the codeword \({\mathbf X}\).

  2. 2.

    More precisely, it is the opposite way to marginalization. Marginalization is the computation to obtain the probability distribution with fewer variables from a multivariate probability distribution, e.g. the marginal distribution of the random variable \(A\) is given by \(\displaystyle P_{A}(a) = \sum _{b\in {\fancyscript{B}}} P_{AB}(a,b)\), where \({\fancyscript{B}}\) is the domain of the random variable \(B\).

References

  1. R.G. Gallager, in Low-Density Parity-Check Codes (MIT Press, Cambridge, 1963)

    Google Scholar 

  2. S. Lin, D.J. Costello, in Error Control Coding, 2nd edn. (Prentice Hall, Englewood Cliffs, 2004)

    Google Scholar 

  3. T.J. Richardson, R. Urbanke, in Modern Coding Theory (Cambridge University Press, Cambridge, 2008)

    Google Scholar 

  4. W.E. Ryan, S. Lin, in Channel Codes: Classical and Modern (Cambridge University Press, Cambridge, 2009)

    Google Scholar 

  5. C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. (1948)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hironori Uchikawa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Japan

About this chapter

Cite this chapter

Uchikawa, H. (2014). Error Correcting Codes Based on Probabilistic Decoding and Sparse Matrices. In: Nishii, R., et al. A Mathematical Approach to Research Problems of Science and Technology. Mathematics for Industry, vol 5. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55060-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-55060-0_36

  • Published:

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-55059-4

  • Online ISBN: 978-4-431-55060-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics