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

Ankit S. Rawat; Natalia Silberstein; O. Ozan Koyluoglu; Sriram Vishwanath

doi:10.1109/ITA.2013.6502983

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

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

Electrical and Computer Engineering

Research output: Contribution to conference › Paper › peer-review

7 Scopus citations

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 language	English (US)
Pages	421-428
Number of pages	8
DOIs	https://doi.org/10.1109/ITA.2013.6502983
State	Published - 2013
Event	2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, United States Duration: Feb 10 2013 → Feb 15 2013

Other

Other	2013 Information Theory and Applications Workshop, ITA 2013
Country/Territory	United States
City	San Diego, CA
Period	2/10/13 → 2/15/13

Keywords

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

ASJC Scopus subject areas

Computer Science Applications
Information Systems

Access to Document

10.1109/ITA.2013.6502983

Cite this

@conference{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, {O. Ozan} and Sriram Vishwanath",

year = "2013",

doi = "10.1109/ITA.2013.6502983",

language = "English (US)",

pages = "421--428",

note = "2013 Information Theory and Applications Workshop, ITA 2013 ; Conference date: 10-02-2013 Through 15-02-2013",

}

TY - CONF

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

AU - Rawat, Ankit S.

AU - Silberstein, Natalia

AU - Koyluoglu, O. 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 - Paper

AN - SCOPUS:84877637668

SP - 421

EP - 428

T2 - 2013 Information Theory and Applications Workshop, ITA 2013

Y2 - 10 February 2013 through 15 February 2013

ER -

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

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this