Reed-solomon Codes
Reed-Solomon Codes is a type of non-binary cyclic error-correcting code that achieves maximum distance separable (MDS) properties by encoding messages as evaluations of a polynomial over a finite field, thereby enabling the correction of burst errors and symbol-level erasures in data transmission and storage systems.
1.4K
Publications
65K
Citations
2.5K
Authors
875
Institutions
Publications per year
2017–2026
223
1.4K
1–5 of 1.4K
2.5K
17
h-index
15
h-index
15
h-index
14
h-index
14
h-index
1–5 of 2.5K
875
University of Illinois Urbana-Champaign
Urbana, United States
28 h-index
78 publications
5.8K citations
University of Southern California
Los Angeles, United States
23 h-index
44 publications
4.6K citations
Jet Propulsion Laboratory
Pasadena, United States
22 h-index
57 publications
4K citations
University of California, Davis
Davis, United States
18 h-index
77 publications
4.7K citations
University of California San Diego
San Diego, United States
18 h-index
56 publications
2.4K citations
Nanyang Technological University
Singapore, Singapore
17 h-index
37 publications
1.2K citations
California Institute of Technology
Pasadena, United States
16 h-index
39 publications
2.9K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
53 publications
1.3K citations
1–8 of 875
214 publications · 16.8K citations
66
h-index
123 publications · 4.1K citations
35
h-index
30 publications · 2.7K citations
21
h-index
23 publications · 2K citations
18
h-index
21 publications · 706 citations
17
h-index
1–5