An Improved Bound for Optimal Locally Repairable Codes

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3379-3384
Number of pages6
ISBN (Electronic)9781538682098
DOIs
StatePublished - 12 Jul 2021
Event2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia
Duration: 12 Jul 202120 Jul 2021

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2021-July
ISSN (Print)2157-8095

Conference

Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/TerritoryAustralia
CityVirtual, Melbourne
Period12/07/2120/07/21

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'An Improved Bound for Optimal Locally Repairable Codes'. Together they form a unique fingerprint.

Cite this