Scalable Family of Codes with Locality and Availability for Information Repair in Distributed Storage Systems

In healthcare applications storage systems must offer maximum availability, functionality, efficiency and high data accessibility especially for life-critical applications. The expected explosive growth of data volumes adds a new requirement to these systems, namely simple and not too costly scalability. In this paper one new scalable family of codes with locality and availability for information repair in data storage systems is presented, which addresses some of these requirements. The construction of this code family is based on [7], [3], [4] Simplex code's graph. The code could be prolonged indefinitely by adding a set of four nodes in each incrementation, of which one contains information and the three other contain redundancy. The computational complexity and communication costs of each incrementation are constant and very modest.