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

Series on coding theory and cryptology

LOW-DENSITY PARITY-CHECK CODES AND THE RELATED PERFORMANCE ANALYSIS METHODS

Xudong Ma

Published Feb 1, 2010• 0 citations
Publisher

Abstract

Low-density parity-check (LDPC) codes are a class of error-correction codes, which attract much attention recently. The LDPC codes can approach within one-tenth dB of the Shannon limits. The codes have already found many applications in practice. This chapter presents a tutorial exposition of LDPC codes and the related performance analysis methods.

DOI
10.1142/9789812837172_0011

Related papers

AN INTRODUCTION TO LOW-DENSITY PARITY-CHECK CODES

Todd K. Moon, Jacob H. Gunther

Low-Density Parity-Check (LDPC) codes are powerful codes capable of nearly achieving the Shannon channel capacity. This paper presents a tutorial introduction to LDPC codes, with a detailed description of the decoding algorithm. The algorithm propagates information about bit and check probabilities through a tree obtained from the Tanner graph for the code. This paper may be useful as a supplement in a course on error-control coding or digital communication.

•Oct 1, 2003•3 citations

A REVIEW OF CONSTRUCTION METHODS FOR REGULAR LDPC CODES

Nisha Sarwade

Low-Density parity-check (LDPC) codes are one of the most powerful error correcting codes available today. Their Shannon capacity approaching performance and lower decoding complexity have made them the best choice for many wired and wireless applications. This paper gives an overview about LDPC codes and compares the Gallager’s method, Reed-Solomon based algebraic method and the Progressive edge growth (PEG) combinatorial method for the construction of regular LDPC codes.

•Jan 1, 2012•7 citations

Low-density Parity-Check decoding Algorithms

Florent Pirou

Recently, low-density parity-check (LDPC) codes have attracted much attention because of their excellent error correcting performance and highly parallelizable decoding scheme. However, the effective VLSI implementation of and LDPC decoder remains a big challenge and is a crucial issue in determining how well we can exploit the benefits of the LDPC codes in the real applications. In this master thesis report, following a error coding background, we describe Low-Density Parity-Check codes and their decoding algorithm, and also requirements and architectures of LPDC decoder implementations.

•Jan 1, 2004•0 citations

Capacity-Approaching Low-Density Parity-Check Codes

Pierre J. Garrigues

The class of low-density parity-check (LDPC) codes was introduced by Gallager in his thesis in 1961 [2]. Until the invention of turbo codes, they were largely neglected, but received a lot of interest lately, due to the possibility of designing LDPC codes within 0.0045 dB of the Shannon limit. We review in this project techniques used to analyze the performance of LDPC codes under a message-passing decoding algorithm, namely belief propagation (BP) [4][5]. This analysis gives us the tools to design good LDPC codes. We will first take the simpler example of transmission over the class of binary erasure channels (BEC). We will then see how it is possible to extend the results for the BEC to the much more general class of symmetric channels.

•Jan 1, 2005•0 citations

REVIEW ON CONSTRUCTION METHODS FOR REGULAR AND NON-QUASI CYCLIC LDPC CODES

S Vengatesh Kumar

Low Density Parity Check (LDPC) codes are one of the most powerful error correction codes available today. Its Shannon capability that closely matches performance and lower decoding complexity has made them the best choice for many wired and wireless applications. This Paper provides an overview of the LDPC codes and compares the Gallager method, the Reed-Solomon-based algebraic method, and the combinatorial Progressive Growth (PEG) method for constructing regular LDPC codes and also Overlapped and Modified overlapped message passing algorithm for Non-Quasi Cyclic(NQC) LDPC codes.

ICTACT Journal on Communication Technology•Sep 1, 2019•0 citations

Low-density parity-check codes

Sarah J. Johnson

Introduction In this chapter we introduce low-density parity-check (LDPC) codes, a class of error correction codes proposed by Gallager in his 1962 PhD thesis 12 years after error correction codes were first introduced by Hamming (published in 1950). Both Hamming codes and LDPC codes are block codes: the messages are broken up into blocks to be encoded at the transmitter and similarly decoded as separate blocks at the receiver. While Hamming codes are short and very structured with a known, fixed, error correction ability, LDPC codes are the opposite, usually long and often constructed pseudo-randomly with only a probabilistic notion of their expected error correction performance. The chapter begins by presenting parity bits as a means to detect and, when more than one is employed, to correct errors in digital data. Block error correction codes are described as a linear combination of parity-check equations and thus defined by their parity-check matrix representation. The graphical representation of codes by Tanner graphs is presented and the necessary graph theoretic concepts introduced. In Section 2.4 iterative decoding algorithms are introduced using a hard decision algorithm (bit flipping), so that the topic is developed first without reference to probability theory. Subsequently the sum–product decoding algorithm is presented. This chapter serves as a self-contained introduction to LDPC codes and their decoding. It is intended that the material presented here will enable the reader to implement LDPC encoders and iterative decoders.

Cambridge University Press eBooks•Nov 19, 2009•6 citations
Low-density parity-check (LDPC) codes are a class of error-correction codes, which attract much attention recently. The LDPC codes can approach within one-tenth dB of the Shannon limits. The codes have already found many applications in practice. This chapter presents a tutorial exposition of LDPC codes and the related performance analysis methods.
Recently, low-density parity-check (LDPC) codes have attracted much attention because of their excellent error correcting performance and highly parallelizable decoding scheme. However, the effective VLSI implementation of and LDPC decoder remains a big challenge and is a crucial issue in determining how well we can exploit the benefits of the LDPC codes in the real applications. In this master thesis report, following a error coding background, we describe Low-Density Parity-Check codes and their decoding algorithm, and also requirements and architectures of LPDC decoder implementations.
The class of low-density parity-check (LDPC) codes was introduced by Gallager in his thesis in 1961 [2]. Until the invention of turbo codes, they were largely neglected, but received a lot of interest lately, due to the possibility of designing LDPC codes within 0.0045 dB of the Shannon limit. We review in this project techniques used to analyze the performance of LDPC codes under a message-passing decoding algorithm, namely belief propagation (BP) [4][5]. This analysis gives us the tools to design good LDPC codes. We will first take the simpler example of transmission over the class of binary erasure channels (BEC). We will then see how it is possible to extend the results for the BEC to the much more general class of symmetric channels.
Low Density Parity Check (LDPC) codes are one of the most powerful error correction codes available today. Its Shannon capability that closely matches performance and lower decoding complexity has made them the best choice for many wired and wireless applications. This Paper provides an overview of the LDPC codes and compares the Gallager method, the Reed-Solomon-based algebraic method, and the combinatorial Progressive Growth (PEG) method for constructing regular LDPC codes and also Overlapped and Modified overlapped message passing algorithm for Non-Quasi Cyclic(NQC) LDPC codes.
Introduction In this chapter we introduce low-density parity-check (LDPC) codes, a class of error correction codes proposed by Gallager in his 1962 PhD thesis 12 years after error correction codes were first introduced by Hamming (published in 1950). Both Hamming codes and LDPC codes are block codes: the messages are broken up into blocks to be encoded at the transmitter and similarly decoded as separate blocks at the receiver. While Hamming codes are short and very structured with a known, fixed, error correction ability, LDPC codes are the opposite, usually long and often constructed pseudo-randomly with only a probabilistic notion of their expected error correction performance. The chapter begins by presenting parity bits as a means to detect and, when more than one is employed, to correct errors in digital data. Block error correction codes are described as a linear combination of parity-check equations and thus defined by their parity-check matrix representation. The graphical representation of codes by Tanner graphs is presented and the necessary graph theoretic concepts introduced. In Section 2.4 iterative decoding algorithms are introduced using a hard decision algorithm (bit flipping), so that the topic is developed first without reference to probability theory. Subsequently the sum–product decoding algorithm is presented. This chapter serves as a self-contained introduction to LDPC codes and their decoding. It is intended that the material presented here will enable the reader to implement LDPC encoders and iterative decoders.