Abstract:

A kind of minimum storage regenerating (MSR) codes is constructed for exact-repairing nodes in the distributed storage systems. The codes based on cyclic vectors based are belonged to the maximum distance separable (MDS) erasure codes. Both the system and the redundancy data are saved in each node. All the calculation of the encoding and the decoding are in the Galois field 2. The storage system could exactly repair any single node’s error with the minimum bandwidth in theory. The system could provide a maximum bandwidth in theory for the single user. Compared with other MSR codes, those codes, with minimum bandwidth regenerating repair codes, have more straightforward structure and less decoding operation, and can provide the most available bandwidth for the single user.

Key words: cyclic vector, exact-repair, maximum-distance separable code, distributed storage