Locality and Availability of Array Codes Constructed From Subspaces

被引：20

作者：

Silberstein, Natalia ^{[1
,2
]}

Etzion, Tuvi ^{[3
]}

Schwartz, Moshe ^{[1
]}

机构：

[1] Ben Gurion Univ Negev, Dept Elect & Comp Engn, IL-8410501 Beer Sheva, Israel

[2] Yahoo Res, IL-31905 Haifa, Israel

[3] Technion Israel Inst Technol, Dept Comp Sci, IL-3200003 Haifa, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2019年 / 65卷 / 05期

关键词：

Locally repairable codes; distributed storage; availability; q-analog; FRACTIONAL REPETITION CODES; GRAPHS;

D O I：

10.1109/TIT.2018.2876421

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We study array codes which are based on subspaces of a linear space over a finite field, using spreads, q-Steiner systems, and subspace transversal designs. We present several constructions of such codes which are q-analogs of some known block codes, such as the Hamming and simplex codes. We examine the locality and availability of the constructed codes. In particular, we distinguish between two types of locality and availability: node versus symbol. The resulting codes have distinct symbol/node locality/availability, allowing a more efficient repair process for a single symbol stored in a storage node of a distributed storage system, compared with the repair process for the whole node.

引用

页码：2648 / 2660

页数：13