Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Decoding of LDPC Codes

Grigory A. Kabatiansky, Evgenii A. Krouk, Sergei Semenov

Published Feb 4, 2005• 2 citations
Publisher

Abstract

This chapter contains sections titled: Low-Density Parity-Check Codes LDPC Constructions Estimating the Minimum Distance of EG-LDPC Codes Burst-Error-Correcting LDPC Codes Decoding Schemes of LDPC Codes Simulation Results in AWGN Appendix 5.A Euclidean Geometries
DOI
10.1002/0470867574.ch5

Related papers

Non‐Binary Low‐Density Parity Check Codes

Rolando Antonio Carrasco, Martin Johnston

This chapter contains sections titled: Introduction Construction of Binary LDPC Codes – Random and Structured Methods Decoding of Binary LDPC Codes Using the Belief Propagation Algorithm Construction of Non-Binary LDPC Codes Defined Over Finite Fields Decoding Non-Binary LDPC Codes with the Sum–Product Algorithm Conclusions References

Wiley eBooks•Nov 28, 2008•2 citations

An Introduction to LDPC Codes

Irene Márquez-Corbella, Edgar Martínez-Moro

The focus of this chapter is on low-density parity-check (LDPC) codes and iterative decoding methods. Low density parity check codes were originally introduced by Gallager in his doctoral thesis in 1963 [19]. Gallager discussed several iterative decoding algorithms for these codes that in general have very good error-correcting capabilities. Later, Tanner [32] in 1981 gave a graphical interpretation to these codes as a bi-partite graph whose incidence matrix is the parity check matrix of the LDPC code, and showed how to view the iterative decoding algorithms as message-passing algorithms on these graphs.

Series on coding theory and cryptology•Feb 1, 2013•4 citations

Decoding Techniques of LDPC Codes

Devashree Marotkar, Vivek Kapur, Shital S. Bramhe

In this paper, we will Discuss Decoding technique of Low Density Parity check (LDPC) codes.Using Results we can evaluate which decoding procedure is better.

IJIREEICE•Mar 15, 2015•3 citations

A Euclidean Geometry Based Algebraic Construction Technique for Girth-8 Gallager LDPC Codes

Mark F. Flanagan, John Craddock, Colm P. Fewer +1 more

A construction technique is proposed for low-density parity-check (LDPC) codes based on finite Euclidean geometries EG(m,2s). These codes are shown to be regular Gallager codes with Tanner graphs of girth eight. The minimum distance of these codes is shown to be lower-bounded by 2m. The codes are also amenable to an efficient partly parallel decoder implementation, which may be used in conjunction with the turbo decoding message passing (TDMP) algorithm for LDPC decoding. Finally, simulation results show that these codes have very good error-correcting performance

IEEE Information Theory Workshop (ITW)•Oct 1, 2006•8 citations

Decoding techniques of LDPC codes

Devashree Marotkar, N. A. Bodhaye

In this paper, we will Discuss Decoding technique of Low Density Parity check (LDPC) codes. Using Results we can evaluate which decoding procedure is better.

International Conference & Workshop on Emerging Trends in Technology•Feb 25, 2011•1 citation

Burst-Correction Decoding of Cyclic LDPC Codes

Shumei Song, Shu Lin, Khaled Abdel-Ghaffar

LDPC codes have excellent performance when iteratively decoded based on sparse parity-check matrices over both the AWGN channel and the erasure channel. In this paper, we propose a simple burst-correction decoding scheme for cyclic LDPC codes based on the same sparse circulant parity-check matrices used to perform iterative decoding. Although the proposed scheme may not achieve the full burst-correcting capability of the codes, it is rather simple and fast. We also show that the full burst-correcting capabilities of some codes constructed from Euclidean and projective geometries are very close to the Reiger upper bound

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•4 citations
The focus of this chapter is on low-density parity-check (LDPC) codes and iterative decoding methods. Low density parity check codes were originally introduced by Gallager in his doctoral thesis in 1963 [19]. Gallager discussed several iterative decoding algorithms for these codes that in general have very good error-correcting capabilities. Later, Tanner [32] in 1981 gave a graphical interpretation to these codes as a bi-partite graph whose incidence matrix is the parity check matrix of the LDPC code, and showed how to view the iterative decoding algorithms as message-passing algorithms on these graphs.
A construction technique is proposed for low-density parity-check (LDPC) codes based on finite Euclidean geometries EG(m,2s). These codes are shown to be regular Gallager codes with Tanner graphs of girth eight. The minimum distance of these codes is shown to be lower-bounded by 2m. The codes are also amenable to an efficient partly parallel decoder implementation, which may be used in conjunction with the turbo decoding message passing (TDMP) algorithm for LDPC decoding. Finally, simulation results show that these codes have very good error-correcting performance
LDPC codes have excellent performance when iteratively decoded based on sparse parity-check matrices over both the AWGN channel and the erasure channel. In this paper, we propose a simple burst-correction decoding scheme for cyclic LDPC codes based on the same sparse circulant parity-check matrices used to perform iterative decoding. Although the proposed scheme may not achieve the full burst-correcting capability of the codes, it is rather simple and fast. We also show that the full burst-correcting capabilities of some codes constructed from Euclidean and projective geometries are very close to the Reiger upper bound