Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran · IEEE Transactions on Information Theory · 2011
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary$k$of$n$nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary$d$nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact.