A tabulation of explicit codes for distributed storage systems that address the problem of efficient repair of failed nodes.
| Parameters [n, k, d] | Authors |
| [n, k, d ≥ 2k-2] | Rashmi-Shah-Kumar |
| [n=k+2 and k+3, k, d=n-1] | Cadambe-Huang-Jafar-Li |
| [n=k+2, k, d=n-1] | Papailiopoulos-Dimakis-Cadambe |
| Tamo-Wang-Bruck |
| [n, k, d=n-1 ≥ 2k-1] | Suh-Ramchandran |
| Shah-Rashmi-Kumar-Ramchandran |
| [n=5, k=3, d=4] | Cullina-Dimakis-Ho |
| Suh-Ramchandran |
| [n=4, k=2, d=3] | Wang-Mateescu-Dimakis-Bruck |
(Cadambe-Jafar-Maleki and Suh-Ramchandran have shown asymptotic existence of exact-MSR codes for all [n, k, d], while Shah-Rashmi-Kumar-Ramchandran have shown the non-existence of scalar linear exact-MSR codes when d < 2k-3.)
(Shah-Rashmi-Kumar-Ramchandran have shown non-existence of exact-repair codes at essentially all interior points on the storage-bandwidth tradeoff of regenerating codes.)
“r” is the number of failed nodes repaired simultaneously.