On the Duality of Fractional Repetition Codes
Information Theory
2020-05-15 v1 math.IT
Abstract
Erasure codes have emerged as an efficient technology for providing data redundancy in distributed storage systems. However, it is a challenging task to repair the failed storage nodes in erasure-coded storage systems, which requires large quantities of network resources. In this paper, we study fractional repetition (FR) codes, which enable the minimal repair complexity and also minimum repair bandwidth during node repair. We focus on the duality of FR codes, and investigate the relationship between the supported file size of an FR code and its dual code. Furthermore, we present a dual bound on the supported file size of FR codes.
Keywords
Cite
@article{arxiv.1710.07909,
title = {On the Duality of Fractional Repetition Codes},
author = {Bing Zhu and Kenneth W. Shum and Hui Li},
journal= {arXiv preprint arXiv:1710.07909},
year = {2020}
}
Comments
Accepted by the 2017 IEEE Information Theory Workshop (ITW 2017)