On the Optimal Minimum Distance of Fractional Repetition Codes
Information Theory
2020-05-15 v1 math.IT
Abstract
Fractional repetition (FR) codes are a class of repair efficient erasure codes that can recover a failed storage node with both optimal repair bandwidth and complexity. In this paper, we study the minimum distance of FR codes, which is the smallest number of nodes whose failure leads to the unrecoverable loss of the stored file. We consider upper bounds on the minimum distance and present several families of explicit FR codes attaining these bounds. The optimal constructions are derived from regular graphs and combinatorial designs, respectively.
Keywords
Cite
@article{arxiv.2005.06823,
title = {On the Optimal Minimum Distance of Fractional Repetition Codes},
author = {Bing Zhu and Kenneth W. Shum and Weiping Wang and Jianxin Wang},
journal= {arXiv preprint arXiv:2005.06823},
year = {2020}
}