Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Ankit S. Rawat, Natalia Silberstein, Onur Ozan Koyluoglu, Sriram Vishwanath

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

4 Citations (Scopus)

Abstract

This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems. The codes possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides minimum distance optimal vector and scalar LRCs for a wide range of parameters. In addition, vector LRCs that allow for efficient local repair of failed nodes are considered. Towards this, the paper derives an upper bound on the amount of data that can be stored on DSS employing minimum distance optimal LRCs with given repair bandwidth, and presents codes which attain this bound by combining MRD and minimum storage regenerating (MSR) codes.

Original languageEnglish (US)
Title of host publication2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings
Pages421-428
Number of pages8
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, United States
Duration: Feb 10 2013Feb 15 2013

Other

Other2013 Information Theory and Applications Workshop, ITA 2013
CountryUnited States
CitySan Diego, CA
Period2/10/132/15/13

Fingerprint

Repair
Bandwidth

Keywords

  • Coding for distributed storage systems
  • locally repairable codes
  • repair bandwidth efficient codes

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Rawat, A. S., Silberstein, N., Koyluoglu, O. O., & Vishwanath, S. (2013). Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes. In 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings (pp. 421-428). [6502983] https://doi.org/10.1109/ITA.2013.6502983

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes. / Rawat, Ankit S.; Silberstein, Natalia; Koyluoglu, Onur Ozan; Vishwanath, Sriram.

2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings. 2013. p. 421-428 6502983.

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

Rawat, AS, Silberstein, N, Koyluoglu, OO & Vishwanath, S 2013, Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes. in 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings., 6502983, pp. 421-428, 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States, 2/10/13. https://doi.org/10.1109/ITA.2013.6502983
Rawat AS, Silberstein N, Koyluoglu OO, Vishwanath S. Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes. In 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings. 2013. p. 421-428. 6502983 https://doi.org/10.1109/ITA.2013.6502983
Rawat, Ankit S. ; Silberstein, Natalia ; Koyluoglu, Onur Ozan ; Vishwanath, Sriram. / Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes. 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings. 2013. pp. 421-428
@inproceedings{b3c8161a786f4645919ae39715e22ba0,
title = "Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes",
abstract = "This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems. The codes possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides minimum distance optimal vector and scalar LRCs for a wide range of parameters. In addition, vector LRCs that allow for efficient local repair of failed nodes are considered. Towards this, the paper derives an upper bound on the amount of data that can be stored on DSS employing minimum distance optimal LRCs with given repair bandwidth, and presents codes which attain this bound by combining MRD and minimum storage regenerating (MSR) codes.",
keywords = "Coding for distributed storage systems, locally repairable codes, repair bandwidth efficient codes",
author = "Rawat, {Ankit S.} and Natalia Silberstein and Koyluoglu, {Onur Ozan} and Sriram Vishwanath",
year = "2013",
doi = "10.1109/ITA.2013.6502983",
language = "English (US)",
pages = "421--428",
booktitle = "2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings",

}

TY - GEN

T1 - Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

AU - Rawat, Ankit S.

AU - Silberstein, Natalia

AU - Koyluoglu, Onur Ozan

AU - Vishwanath, Sriram

PY - 2013

Y1 - 2013

N2 - This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems. The codes possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides minimum distance optimal vector and scalar LRCs for a wide range of parameters. In addition, vector LRCs that allow for efficient local repair of failed nodes are considered. Towards this, the paper derives an upper bound on the amount of data that can be stored on DSS employing minimum distance optimal LRCs with given repair bandwidth, and presents codes which attain this bound by combining MRD and minimum storage regenerating (MSR) codes.

AB - This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems. The codes possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides minimum distance optimal vector and scalar LRCs for a wide range of parameters. In addition, vector LRCs that allow for efficient local repair of failed nodes are considered. Towards this, the paper derives an upper bound on the amount of data that can be stored on DSS employing minimum distance optimal LRCs with given repair bandwidth, and presents codes which attain this bound by combining MRD and minimum storage regenerating (MSR) codes.

KW - Coding for distributed storage systems

KW - locally repairable codes

KW - repair bandwidth efficient codes

UR - http://www.scopus.com/inward/record.url?scp=84877637668&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877637668&partnerID=8YFLogxK

U2 - 10.1109/ITA.2013.6502983

DO - 10.1109/ITA.2013.6502983

M3 - Conference contribution

SP - 421

EP - 428

BT - 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings

ER -