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)

Abstract

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
Volume21
Issue number8
DOIs
Publication statusPublished - 2017 Aug

Fingerprint

Availability
Dependent
Batch
Tightness
Cardinality
Disjoint
Alternatives
Graph in graph theory

All Science Journal Classification (ASJC) codes

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

Cite this

@article{3ea2b505827a4bc5b7e804574dccbf40,
title = "Alphabet-Dependent Bounds for Locally Repairable Codes with Joint Information Availability",
abstract = "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.",
author = "Kim, {Jung Hyun} and Song, {Hong Yeop}",
year = "2017",
month = "8",
doi = "10.1109/LCOMM.2017.2699968",
language = "English",
volume = "21",
pages = "1687--1690",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

Alphabet-Dependent Bounds for Locally Repairable Codes with Joint Information Availability. / Kim, Jung Hyun; Song, Hong Yeop.

In: IEEE Communications Letters, Vol. 21, No. 8, 7915672, 08.2017, p. 1687-1690.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kim, Jung Hyun

AU - Song, Hong Yeop

PY - 2017/8

Y1 - 2017/8

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/LCOMM.2017.2699968

DO - 10.1109/LCOMM.2017.2699968

M3 - Article

AN - SCOPUS:85029477867

VL - 21

SP - 1687

EP - 1690

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 8

M1 - 7915672

ER -