An Improved Bound for Optimal Locally Repairable Codes

Han Cai; Cuiling Fan; Ying Miao; Moshe Schwartz; Xiaohu Tang

doi:https://doi.org/10.1109/ISIT45174.2021.9518040

An Improved Bound for Optimal Locally Repairable Codes

Han Cai, Cuiling Fan, 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

The Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes is studied. An improved bound is presented by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.

Original language	American English
Title of host publication	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
Pages	3379-3384
Number of pages	6
ISBN (Electronic)	9781538682098
DOIs	https://doi.org/10.1109/ISIT45174.2021.9518040
State	Published - 12 Jul 2021
Event	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021

Publication series

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

Conference

Conference	2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/Territory	Australia
City	Virtual, Melbourne
Period	12/07/21 → 20/07/21

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

https://doi.org/10.1109/ISIT45174.2021.9518040

Cite this

@inproceedings{c664715bf087437eab953fb7a43589d1,

title = "An Improved Bound for Optimal Locally Repairable Codes",

abstract = "The Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes is studied. An improved bound is presented by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.",

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

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

year = "2021",

month = jul,

day = "12",

doi = "https://doi.org/10.1109/ISIT45174.2021.9518040",

language = "American English",

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

pages = "3379--3384",

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

}

Cai, H, Fan, C, Miao, Y, Schwartz, M & Tang, X 2021, An Improved Bound for Optimal Locally Repairable Codes. in 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. IEEE International Symposium on Information Theory - Proceedings, vol. 2021-July, pp. 3379-3384, 2021 IEEE International Symposium on Information Theory, ISIT 2021, Virtual, Melbourne, Australia, 12/07/21. https://doi.org/10.1109/ISIT45174.2021.9518040

An Improved Bound for Optimal Locally Repairable Codes. / Cai, Han; Fan, Cuiling; Miao, Ying et al.
2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. 2021. p. 3379-3384 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2021-July).

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

TY - GEN

T1 - An Improved Bound for Optimal Locally Repairable Codes

AU - Cai, Han

AU - Fan, Cuiling

AU - Miao, Ying

AU - Schwartz, Moshe

AU - Tang, Xiaohu

PY - 2021/7/12

Y1 - 2021/7/12

N2 - The Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes is studied. An improved bound is presented by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.

AB - The Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes is studied. An improved bound is presented by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.

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

U2 - https://doi.org/10.1109/ISIT45174.2021.9518040

DO - https://doi.org/10.1109/ISIT45174.2021.9518040

M3 - Conference contribution

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3379

EP - 3384

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

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

Y2 - 12 July 2021 through 20 July 2021

ER -

An Improved Bound for Optimal Locally Repairable Codes

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this