We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length α (also called a sub-packetization level)...

The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. On one end of this spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes that can match the minimum storage cost of MDS codes while also significantly reducing repai...

In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR locality, for all parameters, that have both optimal minimum-distance and optimal rate. These codes combine ideas from two popular codes in the distri...

Cloud storage systems to protect data from corruptions, redundant data to be tolerate failures of storage and lost data should be repaired when storage fails. Regenerating codes provide fault tolerance by striping data across multiple servers, while using less repair traffic than minimized bandwidth consumption. In previous research implemented practical Data Integrity Protection (DIP) scheme f...

Heterogeneous Distributed Storage Systems (DSSs) are close to the real world applications for data storage. Each node of the considered DSS, may store different number of packets and each having different repair bandwidth with uniform repair traffic. For such heterogeneous DSS, a failed node can be repaired with the help of some specific nodes. In this work, a family of codes based on graph the...

We study the rack-aware storage system where all nodes are organized in racks and within each rack can communicate freely without taxing bandwidth. Rack-aware regenerating codes (RRCs) were proposed for minimizing repair bandwidth single erasures. In initial setting of RRCs, a node requires participation remaining containing failed as well large number helper no failures. Consequently, may be i...