论文标题
基于分数重复代码的最佳最小距离
On the Optimal Minimum Distance of Fractional Repetition Codes
论文作者
论文摘要
分数重复（FR）代码是一类维修有效的擦除代码，可以恢复具有最佳维修带宽和复杂性的失败存储节点。在本文中，我们研究了FR代码的最小距离，FR代码是最少的节点数量，其故障导致存储文件的无法恢复损失。我们考虑在最小距离上的上限，并介绍了达到这些界限的几个明确的FR代码。最佳结构分别来自常规图和组合设计。
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.
