Optimal locally repairable codes via rank-metric codes

Natalia Silberstein, Ankit Singh Rawat, O. Ozan Koyluoglu, Sriram Vishwanath

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

101 Scopus citations

Abstract

This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems which possess all-symbol locality and the largest possible minimum distance, or equivalently, can tolerate the maximum number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides new optimal vector and scalar LRCs. In addition, the paper also discusses mechanisms by which codes obtained using this construction can be used to construct LRCs with efficient local repair of failed nodes by combination of LRCs with regenerating codes.

Original languageEnglish (US)
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1819-1823
Number of pages5
DOIs
StatePublished - Dec 19 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Optimal locally repairable codes via rank-metric codes'. Together they form a unique fingerprint.

  • Cite this

    Silberstein, N., Rawat, A. S., Koyluoglu, O. O., & Vishwanath, S. (2013). Optimal locally repairable codes via rank-metric codes. In 2013 IEEE International Symposium on Information Theory, ISIT 2013 (pp. 1819-1823). [6620541] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620541