Optimal locally repairable systematic codes based on packings
Optimal locally repairable systematic codes based on packings
复制标题
基于封装的最优局部可修复系统代码
DOI：
10.1109/tcomm.2018.2869800
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Xiaohu Tang
中科院分区：
文献类型：
--
作者：
Han Cai;Minquan Cheng;Cuiling Fan;Xiaohu Tang
局部可修码是分布式存储系统中提高修复效率的一个重要手段。在每个修复集只包含一个校验符号的条件下，得到了具有多个不相交修复集的局部可修复码与填充之间的关系。特别是，条件下，最佳的局部可修复代码对应于包装的特点。作为这种联系的应用，通过包装可以得到一些最优局部可修码。具体地说，提出了两种局部可修码的构造，它们不仅推广了一些已知的显式构造，而且给出了具有灵活的新参数的最优局部可修码。
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a connection between locally repairable codes with multiple disjoint repair sets and packings is derived under the condition that each repair set contains exactly one check symbol. Particularly, conditions under which an optimal locally repairable code corresponds to a packing are also characterized. As an application of this connection, some optimal locally repairable codes can be obtained by packings. Specifically, two constructions of locally repairable codes are proposed which not only generalize some known explicit constructions but also give optimal locally repairable codes with flexible new parameters.