Some constructions for Fractional Repetition codes with locality 2

Mi Young Nam; Jung Hyun Kim; Hong Yeop Song

doi:10.1587/transfun.E100.A.936

Some constructions for Fractional Repetition codes with locality 2

Mi Young Nam, Jung Hyun Kim, Hong Yeop Song

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

5 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 language	English
Pages (from-to)	936-943
Number of pages	8
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E100A
Issue number	4
DOIs	https://doi.org/10.1587/transfun.E100.A.936
Publication status	Published - 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

Access to Document

10.1587/transfun.E100.A.936

Cite this

@article{4f87551ffdb54279bb390584e060527e,

title = "Some constructions for Fractional Repetition codes with locality 2",

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.",

author = "Nam, {Mi Young} and Kim, {Jung Hyun} and Song, {Hong Yeop}",

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 {\textcopyright} 2017 The Institute of Electronics, Information and Communication Engineers.",

year = "2017",

month = apr,

doi = "10.1587/transfun.E100.A.936",

language = "English",

volume = "E100A",

pages = "936--943",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "4",

}

TY - JOUR

T1 - Some constructions for Fractional Repetition codes with locality 2

AU - Nam, Mi Young

AU - Kim, Jung Hyun

AU - Song, Hong Yeop

N1 - 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.

PY - 2017/4

Y1 - 2017/4

N2 - 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.

AB - 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.

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

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

U2 - 10.1587/transfun.E100.A.936

DO - 10.1587/transfun.E100.A.936

M3 - Article

AN - SCOPUS:85017356329

SN - 0916-8508

VL - E100A

SP - 936

EP - 943

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 4

ER -

Some constructions for Fractional Repetition codes with locality 2

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this