Construction and Analysis for Minimum Storage Regenerating Codes Based Parity-Check Matrices : Invited Presentation

This paper proposes to analyze and construct minimum storage regenerating (MSR) codes for distributed storage systems based on their parity-check matrices. One codeword of constructed MSR codes is viewed as the superposition of several local codes and a global code, where the global code handles data reconstruction and the local codes deal with node recovery. Thus, the constructed MSR code can straightforward perform reconstruction-by-transfer. Moreover, by analyzing parity-check matrices of the local codes, it is sufficient to reveal the impact of code parameters of the MSR codes for single node failure, which coincides with the existing MSR codes.