On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageAmerican English
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Pages571-576
Number of pages6
ISBN (Electronic)9781728164328
DOIs
StatePublished - 1 Jun 2020
Event2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2020-June

Conference

Conference2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/TerritoryUnited States
CityLos Angeles
Period21/07/2026/07/20

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes'. Together they form a unique fingerprint.

Cite this