An improvement of quasi-cyclic minimum storage regenerating codes for distributed storage

In a distributed storage system, where failure is inclined to happen at one of the storage nodes linked via network, redundancy is often introduced to increase reliability. Erasure coding is universally adopted to optimize the additional storage size for redundancy while enhancing the fault tolerance. Regenerating codes, as a class of erasure codes, make significant contribution to bandwidth-saving when recovering a failed node. A new family of regenerating codes based on quasi-cyclic codes is presented by Bernât Gaston et al. Quasi-cyclic Minimum Storage Regenerating (MSR) codes are very interesting because of their simplicity and low computational requirements. In this paper, an improvement of Quasi-cyclic MSR codes is proposed and its correctness is proven. We not only improve the constraints of construction, but also minimize the number of nodes needed to connect in a repairing process.