Erasure-correcting codes, that support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. In this paper we study a generalization of the usual locally recoverable codes. We consider such codes that any small set of codeword symbols is recoverable from a small number of other symbols. We call this cooperative local repair. We present bounds on the dimension of such codes as well as give explicit constructions of families of codes. Some other results regarding cooperative local repair are also presented, including an analysis for the Hadamard codes.
|Original language||English (US)|
|State||Published - Jan 1 2014|
|Event||2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States|
Duration: Mar 19 2014 → Mar 21 2014
|Other||2014 48th Annual Conference on Information Sciences and Systems, CISS 2014|
|Period||3/19/14 → 3/21/14|