Parity-check Matrices
Parity-Check Matrices is a mathematical construct in coding theory that defines a linear transformation enabling the systematic verification of data integrity in erasure-correcting codes by mapping codewords to a syndrome space whose nullspace characterizes valid encodings.
1.2K
Publications
84.1K
Citations
2K
Authors
740
Institutions
Publications per year
2017–2026
174
Parents
1.2K
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
Binary codes capable of correcting deletions, insertions and reversals
V.I. Levenshtein · Soviet physics. Doklady · 1965 · 10.4K citations
1–5 of 1.2K
2K
20
h-index
19
h-index
17
h-index
14
h-index
12
h-index
1–5 of 2K
740
University of California, Davis
Davis, United States
21 h-index
105 publications
4.5K citations

Carleton University
Ottawa, Canada
19 h-index
47 publications
2K citations
University of Arizona
Tucson, United States
18 h-index
53 publications
2.4K citations
University of Illinois Urbana-Champaign
Urbana, United States
18 h-index
34 publications
1.5K citations

Xidian University
Xi'an, China
16 h-index
68 publications
1.7K citations
Technion – Israel Institute of Technology
Haifa, Israel
16 h-index
22 publications
1.8K citations
University of California San Diego
San Diego, United States
14 h-index
31 publications
1.4K citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
27 publications
1.4K citations
1–8 of 740
215 publications · 31.1K citations
64
h-index
77 publications · 3.9K citations
33
h-index
75 publications · 2.7K citations
30
h-index
38 publications · 1.1K citations
20
h-index
33 publications · 1.6K citations
17
h-index
1–5