Optimal binary locally repairable codes with joint information locality

Jung Hyun Kim, Mi Young Nam, Hong-Yeop Song

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

4 Citations (Scopus)

Abstract

We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.

Original languageEnglish
Title of host publicationITW 2015 - 2015 IEEE Information Theory Workshop
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages54-58
Number of pages5
ISBN (Electronic)9781467378529
DOIs
Publication statusPublished - 2015 Dec 17
EventIEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of
Duration: 2015 Oct 112015 Oct 15

Other

OtherIEEE Information Theory Workshop, ITW 2015
CountryKorea, Republic of
CityJeju Island
Period15/10/1115/10/15

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this

Kim, J. H., Nam, M. Y., & Song, H-Y. (2015). Optimal binary locally repairable codes with joint information locality. In ITW 2015 - 2015 IEEE Information Theory Workshop (pp. 54-58). [7360733] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITWF.2015.7360733
Kim, Jung Hyun ; Nam, Mi Young ; Song, Hong-Yeop. / Optimal binary locally repairable codes with joint information locality. ITW 2015 - 2015 IEEE Information Theory Workshop. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 54-58
@inproceedings{832adb10d176405e94bd0458048b4173,
title = "Optimal binary locally repairable codes with joint information locality",
abstract = "We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.",
author = "Kim, {Jung Hyun} and Nam, {Mi Young} and Hong-Yeop Song",
year = "2015",
month = "12",
day = "17",
doi = "10.1109/ITWF.2015.7360733",
language = "English",
pages = "54--58",
booktitle = "ITW 2015 - 2015 IEEE Information Theory Workshop",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Kim, JH, Nam, MY & Song, H-Y 2015, Optimal binary locally repairable codes with joint information locality. in ITW 2015 - 2015 IEEE Information Theory Workshop., 7360733, Institute of Electrical and Electronics Engineers Inc., pp. 54-58, IEEE Information Theory Workshop, ITW 2015, Jeju Island, Korea, Republic of, 15/10/11. https://doi.org/10.1109/ITWF.2015.7360733

Optimal binary locally repairable codes with joint information locality. / Kim, Jung Hyun; Nam, Mi Young; Song, Hong-Yeop.

ITW 2015 - 2015 IEEE Information Theory Workshop. Institute of Electrical and Electronics Engineers Inc., 2015. p. 54-58 7360733.

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

TY - GEN

T1 - Optimal binary locally repairable codes with joint information locality

AU - Kim, Jung Hyun

AU - Nam, Mi Young

AU - Song, Hong-Yeop

PY - 2015/12/17

Y1 - 2015/12/17

N2 - We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.

AB - We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.

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

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

U2 - 10.1109/ITWF.2015.7360733

DO - 10.1109/ITWF.2015.7360733

M3 - Conference contribution

SP - 54

EP - 58

BT - ITW 2015 - 2015 IEEE Information Theory Workshop

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Kim JH, Nam MY, Song H-Y. Optimal binary locally repairable codes with joint information locality. In ITW 2015 - 2015 IEEE Information Theory Workshop. Institute of Electrical and Electronics Engineers Inc. 2015. p. 54-58. 7360733 https://doi.org/10.1109/ITWF.2015.7360733