Code Optimality

Code optimality is the property of an erasure code that achieves the best possible trade-off between storage efficiency, repair bandwidth, and fault tolerance among all codes within a given coding scheme under specified constraints.

304

Publications

16.5K

Citations

468

Authors

261

Institutions

Publications per year

2017–2026

69

Authors

468

  1. AB
    Alexander Barg

    University of Maryland, College Park, United States

    13 publications · 1.4K citations

    12

    h-index

  2. IT
    Itzhak Tamo

    Tel Aviv University, Israel

    11 publications · 1.2K citations

    10

    h-index

  3. AG
    Alexandros G. Dimakis

    The University of Texas at Austin, United States

    9 publications · 868 citations

    9

    h-index

  4. PV
    P. Vijay Kumar

    University of Southern California, United States

    9 publications · 411 citations

    9

    h-index

  5. JB
    Jehoshua Bruck

    California Institute of Technology, United States

    8 publications · 408 citations

    8

    h-index

1–5 of 468

Venues

  1. IEEE Transactions on Information Theory

    84 publications · 5K citations

    37

    h-index

  2. Designs Codes and Cryptography

    17 publications · 579 citations

    14

    h-index

  3. arXiv (Cornell University)

    Repository · 19 publications · 399 citations

    14

    h-index

  4. Discrete Mathematics

    9 publications · 229 citations

    9

    h-index

  5. Finite Fields and Their Applications

    9 publications · 276 citations

    9

    h-index

1–5