论文标题
修复芦苇固体代码的实际考虑
Practical Considerations in Repairing Reed-Solomon Codes
论文作者
论文摘要
文献中零星讨论了目前在行业中修复芦苇 - 固体法规的问题。在这项工作中，我们对这些代码进行了系统的研究，并研究了在痕量修复框架下修复它们的重要方面，包括要选择哪些评估点以及如何有效地实施痕量修复方案。特别是，我们采用不同的启发式算法来搜索典型冗余的短长度代码，并为$ [n，k] $ reed-solomon代码（256）的三张最佳维修方案（256）建立三张最佳维修方案，并用$ 4 \ leq n \ leq n \ leq n \ leq n \ leq n \ leq n \ l =这些表涵盖了当前在分布式存储行业中使用的最著名的代码。
The issue of repairing Reed-Solomon codes currently employed in industry has been sporadically discussed in the literature. In this work we carry out a systematic study of these codes and investigate important aspects of repairing them under the trace repair framework, including which evaluation points to select and how to implement a trace repair scheme efficiently. In particular, we employ different heuristic algorithms to search for low-bandwidth repair schemes for codes of short lengths with typical redundancies and establish three tables of current best repair schemes for $[n, k]$ Reed-Solomon codes over GF(256) with $4 \leq n \leq 16$ and $r = n - k \in \{2,3,4\}$. The tables cover most known codes currently used in the distributed storage industry.
