Optimal fractional repetition codes and fractional repetition batch codes

Natalia Silberstein; Tuvi Etzion

doi:10.1109/ISIT.2015.7282815

Optimal fractional repetition codes and fractional repetition batch codes

Natalia Silberstein, Tuvi Etzion

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth. In this work, we consider a bound on the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain this bound are presented. The constructions of these FR codes are based on families of regular graphs, such as Turán graphs and graphs with large girth; and on combinatorial designs, such as transversal designs and generalized polygons. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, called fractional repetition batch codes, which allow uncoded efficient exact repairs and load balancing which can be performed by several users in parallel.

Original language	English
Title of host publication	Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Publisher	Institute of Electrical and Electronics Engineers
Pages	2046-2050
Number of pages	5
ISBN (Electronic)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282815
State	Published - 28 Sep 2015
Externally published	Yes
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2015-June
ISSN (Print)	2157-8095

Conference

Conference	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	14/06/15 → 19/06/15

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2015.7282815

Cite this

Silberstein, N., & Etzion, T. (2015). Optimal fractional repetition codes and fractional repetition batch codes. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 2046-2050). Article 7282815 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2015.7282815

@inproceedings{e1a4dd03ae1c4ff287c715b7399da276,

title = "Optimal fractional repetition codes and fractional repetition batch codes",

abstract = "Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth. In this work, we consider a bound on the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain this bound are presented. The constructions of these FR codes are based on families of regular graphs, such as Tur{\'a}n graphs and graphs with large girth; and on combinatorial designs, such as transversal designs and generalized polygons. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, called fractional repetition batch codes, which allow uncoded efficient exact repairs and load balancing which can be performed by several users in parallel.",

author = "Natalia Silberstein and Tuvi Etzion",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282815",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "2046--2050",

booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

address = "United States",

}

Silberstein, N & Etzion, T 2015, Optimal fractional repetition codes and fractional repetition batch codes. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282815, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers, pp. 2046-2050, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 14/06/15. https://doi.org/10.1109/ISIT.2015.7282815

Optimal fractional repetition codes and fractional repetition batch codes. / Silberstein, Natalia; Etzion, Tuvi.
Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers, 2015. p. 2046-2050 7282815 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal fractional repetition codes and fractional repetition batch codes

AU - Silberstein, Natalia

AU - Etzion, Tuvi

PY - 2015/9/28

Y1 - 2015/9/28

N2 - Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth. In this work, we consider a bound on the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain this bound are presented. The constructions of these FR codes are based on families of regular graphs, such as Turán graphs and graphs with large girth; and on combinatorial designs, such as transversal designs and generalized polygons. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, called fractional repetition batch codes, which allow uncoded efficient exact repairs and load balancing which can be performed by several users in parallel.

AB - Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth. In this work, we consider a bound on the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain this bound are presented. The constructions of these FR codes are based on families of regular graphs, such as Turán graphs and graphs with large girth; and on combinatorial designs, such as transversal designs and generalized polygons. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, called fractional repetition batch codes, which allow uncoded efficient exact repairs and load balancing which can be performed by several users in parallel.

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

U2 - 10.1109/ISIT.2015.7282815

DO - 10.1109/ISIT.2015.7282815

M3 - Conference contribution

AN - SCOPUS:84969767072

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2046

EP - 2050

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

Optimal fractional repetition codes and fractional repetition batch codes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this