Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Low-density parity-check code

Known as: Gallager code, Ldpc code, LDPC 
In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy… Expand
Wikipedia

Related topics

Related topics

49 relations
ATSC 3.0BCH codeBCJR algorithmBelief propagation
Expand

Broader (2)

Coding theoryError detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Channel Coding in 5G New Radio: A Tutorial Overview and Performance Comparison with 4G LTE
Fifth-generation (5G) new radio (NR) holds promise in fulfilling new communication requirements that enable ubiquitous, low… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Highly Cited
2006
Highly Cited
2006
Efficient encoding of quasi-cyclic low-density parity-check codes
Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an… Expand
Highly Cited
2004
Highly Cited
2004
Design of low-density parity-check codes for modulation and detection
A coding and modulation technique is studied where the coded bits of an irregular low-density parity-check (LDPC) code are passed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Highly Cited
2004
Highly Cited
2004
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is… Expand
Highly Cited
2001
Highly Cited
2001
Design of capacity-approaching irregular low-density parity-check codes
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Highly Cited
2001
Highly Cited
2001
Efficient encoding of low-density parity-check codes
Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Highly Cited
2001
Highly Cited
2001
Improved low-density parity-check codes using irregular graphs
We construct new families of error-correcting codes based on Gallager's (1973) low-density parity-check codes. We improve on… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
Highly Cited
2001
Highly Cited
2001
The capacity of low-density parity-check codes under message-passing decoding
We present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Highly Cited
1998
Highly Cited
1998
Low-density parity check codes over GF(q)
Gallager's (1962) low-density binary parity check codes have been shown to have near-Shannon limit performance when decoded using… Expand
Highly Cited
1962
Highly Cited
1962
Low-density parity-check codes
  • R. Gallager
  • IRE Trans. Inf. Theory
  • 1962
    • Corpus ID: 12709402
A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains… Expand
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 2.3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE