Limitations of piggybacking codes with low substriping
Limitations of piggybacking codes with low substriping
复制标题
DOI：
10.1109/allerton.2017.8262864
复制
发表时间：
2017-10
期刊：
影响因子：
--
通讯作者：
Reyna Hulett;Mary Wootters
中科院分区：
文献类型：
--
作者：
Reyna Hulett;Mary Wootters
用于分布式存储的纠删码设计的背负式框架经实践证明是非常有用的，并且已被用于设计具有理想特性（例如低修复带宽和低复杂度）的编码。然而，该框架的理论特性在很大程度上仍未被探索。我们通过采用修复方案的一般特性描述（先前用于里德 - 所罗门码）来分析低子条带化的背负式编码以解决此问题。利用这种特性描述，我们确定了背负式编码和一般纠删码之间的区别，以及背负式编码子类别中的一些不可能结果；对于某些参数，我们还给出了背负式编码的明确的最优构造。
The piggybacking framework for designing erasure codes for distributed storage has empirically proven to be very useful, and has been used to design codes with desirable properties, such as low repair bandwidth and complexity. However, the theoretical properties of this framework remain largely unexplored. We address this by adapting a general characterization of repair schemes (previously used for Reed-Solomon codes) to analyze piggybacking codes with low sub-striping. With this characterization, we establish a separation between piggybacking and general erasure codes, and several impossibility results for subcategories of piggybacking codes; for certain parameters, we also present explicit, optimal constructions of piggybacking codes.