TY - JOUR
T1 - Locality and Availability of Array Codes Constructed from Subspaces
AU - Silberstein, Natalia
AU - Etzion, Tuvi
AU - Schwartz, Moshe
N1 - Funding Information:
Manuscript received September 25, 2017; revised June 16, 2018; accepted October 11, 2018. Date of publication October 16, 2018; date of current version April 19, 2019. T. Etzion was supported by the NSF–BSF under Grant 2016692. M. Schwartz was supported by the Israeli Science Foundation, Jerusalem, Israel, under Grant 130/14. This paper was presented in part at the 2017 IEEE International Symposium on Information Theory.
Publisher Copyright:
© 1963-2012 IEEE.
PY - 2019/5/1
Y1 - 2019/5/1
N2 - 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.
AB - 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.
KW - Locally repairable codes
KW - availability
KW - distributed storage
KW - q-analog
UR - http://www.scopus.com/inward/record.url?scp=85055026686&partnerID=8YFLogxK
U2 - 10.1109/TIT.2018.2876421
DO - 10.1109/TIT.2018.2876421
M3 - Article
AN - SCOPUS:85055026686
SN - 0018-9448
VL - 65
SP - 2648
EP - 2660
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 5
M1 - 8493531
ER -