Binary locally repairable codes from complete multipartite graphs

Jung Hyun Kim, Mi Young Nam, Hong Yeop Song

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

5 Citations (Scopus)

Abstract

In this paper, we propose a construction of binary locally repairable codes from complete multipartite graphs. Our codes possess joint locality (r1 = 2, r2 = 3 or 4). Joint locality is a set of numbers of symbols for repairing various erasure patterns of symbols. We also provide availability properties of our codes. A code is said to have (r, t)-availability if each of its symbols can be repaired by t disjoint groups of other symbols, each of a size of at most r. As a meaningful result, the proposed code construction can generate binary locally repairable codes achieving (2, t)-availability for any positive integer t.

Original languageEnglish
Title of host publicationInternational Conference on ICT Convergence 2015
Subtitle of host publicationInnovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1093-1095
Number of pages3
ISBN (Electronic)9781467371155
DOIs
Publication statusPublished - 2015 Dec 11
Event6th International Conference on Information and Communication Technology Convergence, ICTC 2015 - Jeju Island, Korea, Republic of
Duration: 2015 Oct 282015 Oct 30

Publication series

NameInternational Conference on ICT Convergence 2015: Innovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015

Other

Other6th International Conference on Information and Communication Technology Convergence, ICTC 2015
CountryKorea, Republic of
CityJeju Island
Period15/10/2815/10/30

Bibliographical note

Funding Information:
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

  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Binary locally repairable codes from complete multipartite graphs'. Together they form a unique fingerprint.

Cite this