On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

Han Cai; Moshe Schwartz

doi:10.1109/ISIT44484.2020.9174051

On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

Han Cai, Moshe Schwartz

Department of Electrical & Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new codes. Based on the recoverable erasure patterns, we construct generalized sector-disk (GSD) codes, which can recover from disk erasures mixed with sector erasures in a more general setting than known sector-disk (SD) codes. Additionally, the number of sectors in the constructed GSD codes is superlinear in the alphabet size, compared with known SD codes, whose number of sectors is only linear in the alphabet size.

Original language	English
Title of host publication	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers
Pages	571-576
Number of pages	6
ISBN (Electronic)	9781728164328
DOIs	https://doi.org/10.1109/ISIT44484.2020.9174051
State	Published - 1 Jun 2020
Event	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: 21 Jul 2020 → 26 Jul 2020

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2020-June
ISSN (Print)	2157-8095

Conference

Conference	2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/Territory	United States
City	Los Angeles
Period	21/07/20 → 26/07/20

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT44484.2020.9174051

Cite this

Cai, H., & Schwartz, M. (2020). On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings (pp. 571-576). Article 9174051 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT44484.2020.9174051

@inproceedings{8348237cc4e44e7585283009738387a7,

title = "On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes",

abstract = "Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new codes. Based on the recoverable erasure patterns, we construct generalized sector-disk (GSD) codes, which can recover from disk erasures mixed with sector erasures in a more general setting than known sector-disk (SD) codes. Additionally, the number of sectors in the constructed GSD codes is superlinear in the alphabet size, compared with known SD codes, whose number of sectors is only linear in the alphabet size.",

author = "Han Cai and Moshe Schwartz",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 IEEE International Symposium on Information Theory, ISIT 2020 ; Conference date: 21-07-2020 Through 26-07-2020",

year = "2020",

month = jun,

day = "1",

doi = "10.1109/ISIT44484.2020.9174051",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "571--576",

booktitle = "2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings",

address = "United States",

}

Cai, H & Schwartz, M 2020, On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings., 9174051, IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, Institute of Electrical and Electronics Engineers, pp. 571-576, 2020 IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, United States, 21/07/20. https://doi.org/10.1109/ISIT44484.2020.9174051

On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. / Cai, Han; Schwartz, Moshe.
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers, 2020. p. 571-576 9174051 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

AU - Cai, Han

AU - Schwartz, Moshe

PY - 2020/6/1

Y1 - 2020/6/1

N2 - Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new codes. Based on the recoverable erasure patterns, we construct generalized sector-disk (GSD) codes, which can recover from disk erasures mixed with sector erasures in a more general setting than known sector-disk (SD) codes. Additionally, the number of sectors in the constructed GSD codes is superlinear in the alphabet size, compared with known SD codes, whose number of sectors is only linear in the alphabet size.

AB - Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new codes. Based on the recoverable erasure patterns, we construct generalized sector-disk (GSD) codes, which can recover from disk erasures mixed with sector erasures in a more general setting than known sector-disk (SD) codes. Additionally, the number of sectors in the constructed GSD codes is superlinear in the alphabet size, compared with known SD codes, whose number of sectors is only linear in the alphabet size.

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

U2 - 10.1109/ISIT44484.2020.9174051

DO - 10.1109/ISIT44484.2020.9174051

M3 - Conference contribution

AN - SCOPUS:85090411017

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 571

EP - 576

BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings

PB - Institute of Electrical and Electronics Engineers

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -

On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this