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

Authors

2.5K

  1. SL
    Shu Lin

    University of California, Davis, United States

    24 publications · 986 citations

    17

    h-index

  2. MP
    M.B. Pursley

    Clemson University, United States

    19 publications · 871 citations

    15

    h-index

  3. RK
    R. Koetter

    University of Illinois Urbana-Champaign, United States

    18 publications · 2.5K citations

    15

    h-index

  4. KA
    Khaled Abdel-Ghaffar

    University of California, Davis, United States

    15 publications · 1K citations

    14

    h-index

  5. XZ
    Xinmiao Zhang

    Case Western Reserve University, United States

    19 publications · 487 citations

    14

    h-index

1–5 of 2.5K

Venues

  1. IEEE Transactions on Information Theory

    214 publications · 16.8K citations

    66

    h-index

  2. IEEE Transactions on Communications

    123 publications · 4.1K citations

    35

    h-index

  3. IEEE Transactions on Computers

    30 publications · 2.7K citations

    21

    h-index

  4. 18

    h-index

  5. IEEE Communications Letters

    21 publications · 706 citations

    17

    h-index

1–5