Maximum Distance Separable Codes

Maximum Distance Separable Codes is an error-correcting code that achieves the maximum possible minimum distance for a given code length and dimension, thereby providing optimal error detection and correction capabilities under the Singleton bound.

190

Publications

11.2K

Citations

358

Authors

208

Institutions

Publications per year

2017–2026

55

Authors

358

  1. MB
    Mario Blaum

    IBM Research - Almaden, United States

    9 publications · 797 citations

    9

    h-index

  2. KR
    Kannan Ramchandran

    University of California, Berkeley, United States

    8 publications · 793 citations

    8

    h-index

  3. CT
    Chao Tian

    AT&T (United States), United States

    7 publications · 282 citations

    7

    h-index

  4. CS
    Changho Suh

    Korea Advanced Institute of Science and Technology, South Korea

    6 publications · 664 citations

    6

    h-index

  5. RM
    Ron M. Roth

    Technion – Israel Institute of Technology, Israel

    6 publications · 584 citations

    6

    h-index

1–5 of 358

Venues

  1. IEEE Transactions on Information Theory

    68 publications · 5.6K citations

    43

    h-index

  2. IEEE Communications Letters

    11 publications · 402 citations

    11

    h-index

  3. IEEE Transactions on Communications

    12 publications · 358 citations

    10

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 141 citations

    4

    h-index

  5. International Journal of Quantum Information

    IJQI · 3 publications · 359 citations

    3

    h-index

1–5