Home/EURASIP Journal on Advances in Signal Processing/Article Record
Peer-Reviewed Article November 30, 2015

Cooperative local repair in distributed storage

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: EURASIP Journal on Advances in Signal Processing
Publisher: Springer Science+Business Media • Egypt • 1110-8657
DOI: https://doi.org/10.1186/s13634-015-0292-0

Abstract

Erasure-correcting codes, which 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.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

61
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.