Low-Density Parity-Check Codes is a class of linear error-correcting codes characterized by a sparse parity-check matrix that enables efficient iterative decoding through probabilistic message-passing algorithms.
2.6K
Publications
152.6K
Citations
4K
Authors
1K
Institutions
Publications per year
2017–2026
527
Publications
2.6K
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
1–5 of 2.6K
Authors
4K
- BV
32
h-index
- AH
31
h-index
- IB
27
h-index
- SL
26
h-index
- MF
26
h-index
1–5 of 4K
Institutions
1K
University of Arizona
Tucson, United States
42 h-index
252 publications
12.2K citations
University of California, Los Angeles
Los Angeles, United States
32 h-index
121 publications
8K citations
Carleton University
Ottawa, Canada
31 h-index
143 publications
6.5K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
30 h-index
109 publications
19.4K citations
Texas A&M University
College Station, United States
28 h-index
142 publications
8K citations
Georgia Institute of Technology
Atlanta, United States
27 h-index
73 publications
6.9K citations
University of California, Davis
Davis, United States
27 h-index
117 publications
10.2K citations
Centre National de la Recherche Scientifique
Paris, France
27 h-index
126 publications
4.4K citations
1–8 of 1K
Venues
- IEEE Transactions on Information Theory
222 publications · 48K citations
81
h-index
- IEEE Transactions on Communications
245 publications · 16K citations
57
h-index
- IEEE Communications Letters
188 publications · 10K citations
42
h-index
- IEEE Transactions on Circuits and Systems I Regular Papers
52 publications · 2.2K citations
30
h-index
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
40 publications · 2.4K citations
29
h-index
1–5