构造小域上的最优局部修复码

发布时间：2018-03-13 09:17

  本文选题：局部修复码　切入点：最优极小距离　出处：《中国科学:数学》2017年11期 　论文类型：期刊论文

【摘要】：局部修复码是近几年分布式存储编码领域一个非常热门的研究方向.满足局部修复性r即要求码字的一位能够被其他至多r位恢复.这种性质对于提高分布式存储系统中失效节点的修复效率非常重要.本文主要考虑了域规模小于n时最优局部修复码的构造.具体地,本文构造了有限域F_q(q=r/(r+1)n_1)满足所有位局部修复性r=2、d=6和d=r+1的最优局部修复码.
[Abstract]:Local repair code is a very popular research field in the field of distributed storage coding in recent years. One bit of code word that meets the requirement of local repair can be recovered by most other r bits. This property is useful for improving distributed storage. The repair efficiency of failure nodes in storage systems is very important. In this paper, the construction of the optimal local repair codes when the domain size is smaller than n is considered. In this paper, we construct the optimal local repair codes of FQ / Q / r / r ~ 1 / n _ 1) for all bits of local repair.
【作者单位】： 中国科学院数学与系统科学研究院;
【分类号】：O157.4
，

本文编号：1605744