Mds Codes

MDS Codes is a type of erasure code that achieves the maximum possible fault tolerance for a given redundancy level by satisfying the Singleton bound with equality, enabling optimal data recovery from the minimum number of encoded fragments.

673

Publications

38.2K

Citations

1.2K

Authors

597

Institutions

Publications per year

2017–2026

226

Authors

1.2K

  1. KR
    Kannan Ramchandran

    University of California, Berkeley, United States

    16 publications · 1.3K citations

    15

    h-index

  2. MB
    Mario Blaum

    IBM Research - Almaden, United States

    14 publications · 1.1K citations

    13

    h-index

  3. JB
    Jehoshua Bruck

    California Institute of Technology, United States

    16 publications · 1.4K citations

    13

    h-index

  4. SZ
    Shixin Zhu

    Hefei University of Technology, China

    12 publications · 827 citations

    12

    h-index

  5. AG
    Alexandros G. Dimakis

    The University of Texas at Austin, United States

    12 publications · 782 citations

    12

    h-index

1–5 of 1.2K

Venues

  1. IEEE Transactions on Information Theory

    139 publications · 10.4K citations

    60

    h-index

  2. Designs Codes and Cryptography

    30 publications · 1K citations

    18

    h-index

  3. arXiv (Cornell University)

    Repository · 31 publications · 736 citations

    16

    h-index

  4. IEEE Transactions on Communications

    19 publications · 573 citations

    14

    h-index

  5. IEEE Communications Letters

    15 publications · 474 citations

    14

    h-index

1–5