Alphabet-Dependent Bounds for Locally Repairable Codes with Joint Information Availability

Jung Hyun Kim, Hong Yeop Song

Research output: Contribution to journalArticle

1 Citation (Scopus)


In this letter, we investigate a class of codes with the following property: any decodable set of erased symbols can be repaired from any single set of several disjoint symbol sets with small cardinality. We refer such codes to locally repairable codes (LRCs) with joint availability. In particular, if information symbols of a code have this property, then we refer the code to an LRC with joint information availability. We propose two alphabet-dependent bounds for LRCs with joint information availability. From the bounds, we rederive some well-known bounds for LRCs. Based on the relation between LRCs and batch codes, we also present an alternative proof of an existing bound for batch codes. Finally, we show the achievability and tightness of the proposed bounds using graph-based codes.

Original languageEnglish
Article number7915672
Pages (from-to)1687-1690
Number of pages4
JournalIEEE Communications Letters
Issue number8
Publication statusPublished - 2017 Aug

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Alphabet-Dependent Bounds for Locally Repairable Codes with Joint Information Availability'. Together they form a unique fingerprint.

  • Cite this