Explicit codes minimizing repair bandwidth for distributed storage
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran · 2010
We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.