LDPC Code is a type of linear error-correcting code characterized by a sparse parity-check matrix, which enables efficient iterative decoding and achieves performance close to the Shannon capacity limit.
3.1K
Publications
162.4K
Citations
4.4K
Authors
1.1K
Institutions
Publications per year
2017–2026
547
Parents
Publications
3.1K
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
1–5 of 3.1K
Authors
4.4K
- SL
32
h-index
- AH
30
h-index
- MF
29
h-index
- IB
28
h-index
- DD
25
h-index
1–5 of 4.4K
Institutions
1.1K
University of Arizona
Tucson, United States
43 h-index
305 publications
13.2K citations
University of California, Davis
Davis, United States
35 h-index
246 publications
14.6K citations
Texas A&M University
College Station, United States
33 h-index
174 publications
9.3K citations
Centre National de la Recherche Scientifique
Paris, France
33 h-index
210 publications
6.8K citations
University of California, Los Angeles
Los Angeles, United States
32 h-index
162 publications
8.6K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
32 h-index
123 publications
18.3K citations
Carleton University
Ottawa, Canada
30 h-index
137 publications
5.9K citations
Qualcomm (United States)
San Diego, United States
29 h-index
44 publications
5.2K citations
1–8 of 1.1K
Venues
- IEEE Transactions on Information Theory
223 publications · 48.7K citations
82
h-index
- IEEE Transactions on Communications
264 publications · 16K citations
58
h-index
- IEEE Communications Letters
211 publications · 8K citations
42
h-index
- IEEE Transactions on Circuits and Systems I Regular Papers
53 publications · 2.4K citations
31
h-index
- IEEE Journal on Selected Areas in Communications
46 publications · 3.7K citations
29
h-index
1–5