On cooperative local repair in distributed storage

Ankit Singh Rawat, Arya Mazumdar, Sriram Vishwanath

Research output: Contribution to conferencePaper

19 Scopus citations

Abstract

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 languageEnglish (US)
DOIs
StatePublished - Jan 1 2014
Event2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States
Duration: Mar 19 2014Mar 21 2014

Other

Other2014 48th Annual Conference on Information Sciences and Systems, CISS 2014
CountryUnited States
CityPrinceton, NJ
Period3/19/143/21/14

Cite this

Rawat, A. S., Mazumdar, A., & Vishwanath, S. (2014). On cooperative local repair in distributed storage. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States. https://doi.org/10.1109/CISS.2014.6814152