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

Publication series

NameITW 2015 - 2015 IEEE Information Theory Workshop

Other

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

Bibliographical note

Funding Information:
ACKNOWLEDGMENT This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2013R1A1A2062061).

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this