Constructions of fractional repetition codes from combinatorial designs

We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. Our codes consist of an outer MDS code followed by an inner fractional repetition (FR) code (introduced in prior work). In these systems a failed node can be repaired by si...

Full description

Saved in:
Bibliographic Details
Published in2013 Asilomar Conference on Signals, Systems and Computers pp. 647 - 651
Main Authors Olmez, Oktay, Ramamoorthy, Aditya
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2013
Subjects
Bandwidth
Bismuth
Decision support systems
Educational institutions
Maintenance engineering
Resilience
Vectors
Online AccessGet full text

Cover

More Information
Summary:We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. Our codes consist of an outer MDS code followed by an inner fractional repetition (FR) code (introduced in prior work). In these systems a failed node can be repaired by simply downloading packets from surviving nodes. We present constructions that use the Kronecker product to construct new fractional repetition codes from existing codes. We demonstrate that an infinite family of codes can be generated by considering the Kronecker product of two Steiner systems that have the same storage capacity. The resultant code inherits its normalized repair bandwidth from the storage capacity of the original Steiner systems and has the maximum level of failure resilience possible. We also present some properties of the Kronecker product of resolvable designs and the corresponding file sizes.
ISSN:2576-2303
DOI:10.1109/ACSSC.2013.6810361