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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights 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)