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

Computer engineering series

An Introduction to LDPC Codes

W.E. Ryan

Published Nov 9, 2004• 212 citations
Publisher
DOI
10.1201/9780203490310.ch36

Related papers

An Introduction to LDPC Codes

Bane Vasic, Erozan M. Kurtas

CRC Press eBooks•Nov 9, 2004•15 citations

Joint Iterative Decoding of LDPC Codes and Channels with Memory

Henry D. Pfister, Paul H. Siegel

Introduction Sequences of irregular low-density parity-check (LDPC) codes that achieve the capacity of the binary erasure channel (BEC) under iterative decoding were first constructed by Luby, et al. in [11]. This was followed by the work of Chung, et al., which provided evidence suggesting that sequences of iteratively decoded LDPC codes can also achieve the channel capacity of the binary-input additive white Gaussian noise (AWGN) channel [3]. Since then, density evolution (DE) [13] has been used to optimize irregular LDPC codes for a variety of memoryless channels (e.g., [6]), and the results suggest, for each channel, that sequences of iteratively decoded LDPC codes can indeed achieve the channel capacity. In fact, the discovery of a channel whose capacity cannot be approached by LDPC codes would be more surprising than a proof that iteratively decoded LDPC codes can achieve the capacity of any binary-input symmetric channel (BISC). The idea of decoding a code transmitted over a c

•Jan 1, 2007•4 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

Overview of LDPC codes

Vikram Arkalgud Chandrasetty, Syed Mahfuzul Aziz

Elsevier eBooks•Dec 12, 2017•4 citations

Detecting Minimum Distance of LDPC Codes with Improved Approximately Nearest Codeword Method

Zhewei Tong, Kewu Peng, Zhitong He

Approximately nearest codeword (ANC) is a classic approach for detecting minimum distance of low-density parity-check (LDPC) codes. With the principle of local search, ANC method is capable of detecting minimum distance of LDPC codes within acceptable time. However, the message passing (MP) decoding algorithm and scheduling scheme, as well as the local search strategy, still have much space to improve. To fill the gap, this paper proposes an improved-ANC method which employs novel noise introduction method, decoding algorithm, scheduling scheme and searching strategy, to accelerate the computation of the minimum distance of LDPC codes significantly. Finally, we run simulations on LDPC codes in Wi-Fi5 and 5G-NR standards. The simulation results are presented and demonstrate the effectiveness of our proposal.

International Conference on Electrical Engineering and Photonics (EExPolytech)•Oct 20, 2022•1 citation

Construction of LDPC codes

Alexios Balatsoukas‐Stimming

•Jan 1, 2009•0 citations
Introduction Sequences of irregular low-density parity-check (LDPC) codes that achieve the capacity of the binary erasure channel (BEC) under iterative decoding were first constructed by Luby, et al. in [11]. This was followed by the work of Chung, et al., which provided evidence suggesting that sequences of iteratively decoded LDPC codes can also achieve the channel capacity of the binary-input additive white Gaussian noise (AWGN) channel [3]. Since then, density evolution (DE) [13] has been used to optimize irregular LDPC codes for a variety of memoryless channels (e.g., [6]), and the results suggest, for each channel, that sequences of iteratively decoded LDPC codes can indeed achieve the channel capacity. In fact, the discovery of a channel whose capacity cannot be approached by LDPC codes would be more surprising than a proof that iteratively decoded LDPC codes can achieve the capacity of any binary-input symmetric channel (BISC). The idea of decoding a code transmitted over a c
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.
Approximately nearest codeword (ANC) is a classic approach for detecting minimum distance of low-density parity-check (LDPC) codes. With the principle of local search, ANC method is capable of detecting minimum distance of LDPC codes within acceptable time. However, the message passing (MP) decoding algorithm and scheduling scheme, as well as the local search strategy, still have much space to improve. To fill the gap, this paper proposes an improved-ANC method which employs novel noise introduction method, decoding algorithm, scheduling scheme and searching strategy, to accelerate the computation of the minimum distance of LDPC codes significantly. Finally, we run simulations on LDPC codes in Wi-Fi5 and 5G-NR standards. The simulation results are presented and demonstrate the effectiveness of our proposal.