论文标题
在最佳的本地维修代码和广义扇形盘代码上
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
论文作者
论文摘要
考虑了最佳的本地维修代码，并考虑了信息局部性。最佳代码是构建的，其长度相对于本文得出的代码长度的新绑定而言也是最佳的。构造代码的长度在字母内的超级线性是在众所周知的金字塔代码上改进的，其长度仅在字母大小中线性。还为新代码分析了可恢复的擦除模式。基于可回收的擦除模式，我们构建了广义的部门磁盘（GSD）代码，该代码可以从与已知的部门磁盘（SD）代码更通用的环境中混合的磁盘擦除恢复。另外，与已知的SD代码相比，构造的GSD代码中的扇区数量是字母内的超级线性，其扇形数量仅在字母表大小中线性。
Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new codes. Based on the recoverable erasure patterns, we construct generalized sector-disk (GSD) codes, which can recover from disk erasures mixed with sector erasures in a more general setting than known sector-disk (SD) codes. Additionally, the number of sectors in the constructed GSD codes is super-linear in the alphabet size, compared with known SD codes, whose number of sectors is only linear in the alphabet size.
