Construction of exact-BASIC codes for distributed storage systems at the MSR point

Regenerating codes (RGC) are a class of distributed storage codes that can provide efficient repair of failure nodes in distributed storage systems. In general, the reduction of repair bandwidth of RGC is at the expense of a small increase in storage cost and computational cost. The high computational complexity of data coding over a finite field of large size makes it unsuitable for practical distributed storage systems. BASIC codes, which stands for Binary Addition and Shift Implementable Convolutional codes, is introduced in [1] with the aim of reducing computational complexity, while retaining the benefits of RGC. In this paper, we present a construction of exact-repair BASIC codes at the minimum-storage point (MSR). A helper node needs no coding to repair a failure node for the minimum-storage BASIC codes. The results of simulation show minimum-storage BASIC codes outperform Cauchy Reed-Solomon codes in both repairing cost and coding cost.