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

Fingerprint

equality

All Science Journal Classification (ASJC) codes

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

Cite this

Kim, J. H., Nam, M. Y., & Song, H. Y. (2017). Alphabet-dependent upper bounds for locally repairable codes with joint locality. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 36-40). [7840381] (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016). Institute of Electrical and Electronics Engineers Inc..
Kim, Jung Hyun ; Nam, Mi Young ; Song, Hong Yeop. / Alphabet-dependent upper bounds for locally repairable codes with joint locality. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 36-40 (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016).
@inproceedings{613edaabb96b45e0ad7e695146dd9964,
title = "Alphabet-dependent upper bounds for locally repairable codes with joint locality",
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.",
author = "Kim, {Jung Hyun} and Nam, {Mi Young} and Song, {Hong Yeop}",
year = "2017",
month = "2",
day = "2",
language = "English",
series = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "36--40",
booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
address = "United States",

}

Kim, JH, Nam, MY & Song, HY 2017, Alphabet-dependent upper bounds for locally repairable codes with joint locality. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840381, Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016, Institute of Electrical and Electronics Engineers Inc., pp. 36-40, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.

Alphabet-dependent upper bounds for locally repairable codes with joint locality. / Kim, Jung Hyun; Nam, Mi Young; Song, Hong Yeop.

Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 36-40 7840381 (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016).

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

TY - GEN

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

AU - Kim, Jung Hyun

AU - Nam, Mi Young

AU - Song, Hong Yeop

PY - 2017/2/2

Y1 - 2017/2/2

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:85015219000

T3 - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

SP - 36

EP - 40

BT - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Kim JH, Nam MY, Song HY. Alphabet-dependent upper bounds for locally repairable codes with joint locality. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 36-40. 7840381. (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016).