On Optimal Locally Repairable Codes with Super-Linear Length

Han Cai; Ying Miao; Moshe Schwartz; Xiaohu Tang

doi:10.1109/ISIT.2019.8849226

On Optimal Locally Repairable Codes with Super-Linear Length

Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang

Department of Electrical & Computer Engineering

Ben-Gurion University of the Negev

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

Abstract

Optimal locally repairable codes with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order optimal when compared with the new upper bounds. The length of the codes is super linear in the alphabet size.

Original language	American English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Pages	2818-2822
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849226
State	Published - 1 Jul 2019
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2019.8849226

Cite this

@inproceedings{5016ebe1434246db86a118345debe13a,

title = "On Optimal Locally Repairable Codes with Super-Linear Length",

abstract = "Optimal locally repairable codes with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order optimal when compared with the new upper bounds. The length of the codes is super linear in the alphabet size.",

author = "Han Cai and Ying Miao and Moshe Schwartz and Xiaohu Tang",

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

year = "2019",

month = jul,

day = "1",

doi = "10.1109/ISIT.2019.8849226",

language = "American English",

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

pages = "2818--2822",

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

}

Cai, H, Miao, Y, Schwartz, M & Tang, X 2019, On Optimal Locally Repairable Codes with Super-Linear Length. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849226, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, pp. 2818-2822, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849226

On Optimal Locally Repairable Codes with Super-Linear Length. / Cai, Han; Miao, Ying; Schwartz, Moshe et al.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. 2019. p. 2818-2822 8849226 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

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

TY - GEN

T1 - On Optimal Locally Repairable Codes with Super-Linear Length

AU - Cai, Han

AU - Miao, Ying

AU - Schwartz, Moshe

AU - Tang, Xiaohu

PY - 2019/7/1

Y1 - 2019/7/1

N2 - Optimal locally repairable codes with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order optimal when compared with the new upper bounds. The length of the codes is super linear in the alphabet size.

AB - Optimal locally repairable codes with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order optimal when compared with the new upper bounds. The length of the codes is super linear in the alphabet size.

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

U2 - 10.1109/ISIT.2019.8849226

DO - 10.1109/ISIT.2019.8849226

M3 - Conference contribution

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2818

EP - 2822

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

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

Y2 - 7 July 2019 through 12 July 2019

ER -

On Optimal Locally Repairable Codes with Super-Linear Length

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this