Locally repairable codes with locality 1 and availability

Mi Young Nam, Jung Hyun Kim, Hong Yeop Song

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

Abstract

In this paper, we propose an optimal scalar locally repairable code (LRC) with locality 1 in the sense of achieving the maximum possible minimum distance using the serial concatenation technique. A technique to construct an optimal vector LRC with locality 1 based on the proposed scalar LRC is also provided.

Original languageEnglish
Title of host publication2016 International Conference on Information and Communication Technology Convergence, ICTC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages36-38
Number of pages3
ISBN (Electronic)9781509013258
DOIs
Publication statusPublished - 2016 Nov 30
Event2016 International Conference on Information and Communication Technology Convergence, ICTC 2016 - Jeju Island, Korea, Republic of
Duration: 2016 Oct 192016 Oct 21

Publication series

Name2016 International Conference on Information and Communication Technology Convergence, ICTC 2016

Other

Other2016 International Conference on Information and Communication Technology Convergence, ICTC 2016
CountryKorea, Republic of
CityJeju Island
Period16/10/1916/10/21

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
  • Hardware and Architecture
  • Signal Processing

Fingerprint Dive into the research topics of 'Locally repairable codes with locality 1 and availability'. Together they form a unique fingerprint.

Cite this