Some constructions for Fractional Repetition codes with locality 2

Mi Young Nam, Jung Hyun Kim, Hong Yeop Song

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

In this paper, we examine the locality property of the original Fractional Repetition (FR) codes and propose two constructions for FR codes with better locality. For this, we first derive the capacity of the FR codes with locality 2, that is the maximum size of the file that can be stored. Construction 1 generates an FR code with repetition degree 2 and locality 2. This code is optimal in the sense of achieving the capacity we derived. Construction 2 generates an FR code with repetition degree 3 and locality 2 based on 4-regular graphs with girth g. This code is also optimal in the same sense.

Original languageEnglish
Pages (from-to)936-943
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE100A
Issue number4
DOIs
Publication statusPublished - 2017 Apr

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). This paper is a full version of 2015 IWSDA proceeding paper "Locally Repairable Fractional Repetition Codes".

Publisher Copyright:
Copyright © 2017 The Institute of Electronics, Information and Communication Engineers.

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Some constructions for Fractional Repetition codes with locality 2'. Together they form a unique fingerprint.

Cite this