Cooperative Local Repair in Distributed Storage

Abstract

Erasure-correcting codes, that support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. This paper investigates a generalization of the usual locally repairable codes. In particular, this paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. This is referred to as cooperative local repair. The main contribution of this paper is bounds on the trade-off of the minimum distance and the dimension of such codes, as well as explicit constructions of families of codes that enable cooperative local repair. Some other results regarding cooperative local repair are also presented, including an analysis for the well-known Hadamard/Simplex codes.

Fixed some minor issues in Theorem 1, EURASIP Journal on Advances in Signal Processing, December 2015

References in corpus (4)

• A family of optimal locally recoverable codes
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• Codes with Locality for Two Erasures
• On the Locality of Codeword Symbols in Non-Linear Codes

Cited by in corpus (9)

• Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
• Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
• Binary Locally Repairable Codes ---Sequential Repair for Multiple Erasures
• Locally recoverable $J$-affine variety codes
• Optimal $(2,\delta )$ Locally Repairable Codes via Punctured Simplex Codes
• Bounds on the Parameters of Locally Recoverable Codes
• Repairing Generalized Reed-Muller Codes
• Cooperative Repair of Multiple Node Failures in Distributed Storage Systems
• Locality and Availability of Array Codes Constructed from Subspaces