Alphabet-dependent upper bounds for locally repairable codes with joint locality

Jung Hyun Kim, Mi Young Nam, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In this paper, we propose two upper bounds for locally repairable codes (LRCs) with joint locality. The bounds take into account the code length, dimension, minimum distance, joint locality, and field size, i.e., the size of code alphabet. We also introduce binary linear LRCs designed by utilizing simple graphs. Some of them with certain choice of parameters achieve both of the bounds simultaneously with equality. With the codes, we show that our bounds are tighter than existing alphabet-dependent upper bound.

Original languageEnglish
Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages36-40
Number of pages5
ISBN (Electronic)9784885523090
Publication statusPublished - 2017 Feb 2
Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: 2016 Oct 302016 Nov 2

Publication series

NameProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

Other

Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
CountryUnited States
CityMonterey
Period16/10/3016/11/2

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Alphabet-dependent upper bounds for locally repairable codes with joint locality'. Together they form a unique fingerprint.

Cite this