TY - GEN
T1 - Optimal fractional repetition codes for distributed storage systems
AU - Silberstein, Natalia
AU - Etzion, Tuvi
N1 - Publisher Copyright:
© Copyright 2015 IEEE All rights reserved.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the 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, namely, Turán graphs and graphs with large girth and on combinatorial designs, namely transversal designs and generalized polygons.
AB - Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the 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, namely, Turán graphs and graphs with large girth and on combinatorial designs, namely transversal designs and generalized polygons.
UR - https://www.scopus.com/pages/publications/84941254852
U2 - 10.1109/EEEI.2014.7005805
DO - 10.1109/EEEI.2014.7005805
M3 - Conference contribution
AN - SCOPUS:84941254852
T3 - 2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014
BT - 2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014
PB - Institute of Electrical and Electronics Engineers
T2 - 2014 28th IEEE Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014
Y2 - 3 December 2014 through 5 December 2014
ER -