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… (More)
Wikipedia

Related topics

Related topics

49 relations
ATSC 3.0BCH codeBCJR algorithmBelief propagation
(More)

Broader (2)

Coding theoryError detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The capacity of low-density parity-check codes under message-passing decoding
In this paper we present a general method for determining the capacity of low-density paritycheck codes under message-passing… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
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 low-density parity-check codes. We improve on Gallager’s… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2001
Highly Cited
2001
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A 690-mW 1Gb / s 1024-b , Rate-1 / 2 Low-Density Parity-Check Code Decoder
A 1024-b, rate-1/2, soft decision low-density paritycheck (LDPC) code decoder has been implemented that matches the coding gain… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Low-density parity-check codes based on finite geometries: A rediscovery and new results
This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1962
Highly Cited
1962
Low-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains… (More)
  • figure 11.1
  • figure 11.2
  • figure 11.3
  • figure 11.4
  • figure 11.5
Is this relevant?