arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.02867cs.ITmath.IT
收藏

具有层次局部性的最大可恢复码

Maximally Recoverable Codes with Hierarchical Locality

Aaditya M Nair, V. Lalitha

摘要:

最大可恢复代码是一类在给定代码的局部性约束的情况下从所有潜在可恢复擦除模式中恢复的代码。在早期的作品中,这些代码已被研究的背景下,代码的地方。局部性的概念已经扩展到层次局部性,这允许局部性随着擦除次数的增加而逐渐增加级别。我们考虑了两级层次局部性代码的局部性约束,并定义了具有数据局部性和局部层次局部性的最大可恢复代码。我们得到了一些性质有关的删余码和最小距离。我们给出了一个过程来构造层次数据局部MRCs从层次局部MRCs。我们提供了一个建设的分层本地MRCs的所有参数。对于一个全局奇偶校验的情况下,我们提供了一个不同的结构层次的本地MRC在一个较低的字段大小。

英文摘要:

Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with locality. The notion of locality has been extended to hierarchical locality, which allows for locality to gradually increase in levels with the increase in the number of erasures. We consider the locality constraints imposed by codes with two-level hierarchical locality and define maximally recoverable codes with data-local and local hierarchical locality. We derive certain properties related to their punctured codes and minimum distance. We give a procedure to construct hierarchical data-local MRCs from hierarchical local MRCs. We provide a construction of hierarchical local MRCs for all parameters. For the case of one global parity, we provide a different construction of hierarchical local MRC over a lower field size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑