Polynomial length MDS codes with optimal repair in distributed storage

Viveck R. Cadambe, Cheng Huang, Jin Li, Sanjeev Mehrotra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Scopus citations

Abstract

An (n, k) maximum distance separable (MDS) code can be used to store data in n storage nodes, such that the system can tolerate the failure of any (n-k) storage nodes. Recently, MDS codes have been constructed which satisfy an additional optimal repair property as follows: the failure of a single storage node can be repaired by downloading a fraction of 1/(n - k) of the data stored in every surviving storage node. In previous constructions satisfying this optimal repair property, the size of the code is polynomial in k for the high-redundancy regime of k/n ≤ 1/2, but the codes have an exponential size (w.r.t. k) for the practically important low-redundancy regime of k/n > 1/2. In this paper, we construct a class of polynomial size codes in this low redundancy regime.

Original languageEnglish (US)
Title of host publicationConference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011
Pages1850-1854
Number of pages5
DOIs
StatePublished - 2011
Event45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011 - Pacific Grove, CA, United States
Duration: Nov 6 2011Nov 9 2011

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011
CountryUnited States
CityPacific Grove, CA
Period11/6/1111/9/11

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Polynomial length MDS codes with optimal repair in distributed storage'. Together they form a unique fingerprint.

Cite this