Regenerating codes and codes with locality are two schemes that have recently
been proposed to ensure data collection and reliability in a distributed
storage network. In a situation where one is attempting to repair a failed
node, regenerating codes seek to minimize the amount of data downloaded for
node repair, while codes with locality attempt to minimize the number of helper
nodes accessed. In this paper, we provide several constructions for a class of
vector codes with locality in which the local codes are regenerating codes,
that enjoy both advantages. We derive an upper bound on the minimum distance of
this class of codes and show that the proposed constructions achieve this
bound. The constructions include both the cases where the local regenerating
codes correspond to the MSR as well as the MBR point on the
storage-repair-bandwidth tradeoff curve of regenerating codes. Also included is
a performance comparison of various code constructions for fixed block length
and minimum distance.

本文提供了一种基于局部编码的向量编码类构造方法，这种编码方法既满足重建码的要求，又具有编码局部性质，能够在分布式储存系统的故障节点修复中最大化地减少数据下载量和辅助节点的个数，并对各种情况下的编码性能进行了比较。