Locality and Availability of Array Codes Constructed from Subspaces

Natalia Silberstein; Tuvi Etzion; Moshe Schwartz

doi:10.1109/TIT.2018.2876421

Locality and Availability of Array Codes Constructed from Subspaces

Natalia Silberstein, Tuvi Etzion, Moshe Schwartz

Department of Electrical & Computer Engineering

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

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.

Original language	English
Article number	8493531
Pages (from-to)	2648-2660
Number of pages	13
Journal	IEEE Transactions on Information Theory
Volume	65
Issue number	5
DOIs	https://doi.org/10.1109/TIT.2018.2876421
State	Published - 1 May 2019

Keywords

Locally repairable codes
availability
distributed storage
q-analog

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2018.2876421

Cite this

@article{f2dc349737bf4d3488f9f06f358136ea,

title = "Locality and Availability of Array Codes Constructed from Subspaces",

abstract = "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.",

keywords = "Locally repairable codes, availability, distributed storage, q-analog",

author = "Natalia Silberstein and Tuvi Etzion and Moshe Schwartz",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2019",

month = may,

day = "1",

doi = "10.1109/TIT.2018.2876421",

language = "English",

volume = "65",

pages = "2648--2660",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "5",

}

TY - JOUR

T1 - Locality and Availability of Array Codes Constructed from Subspaces

AU - Silberstein, Natalia

AU - Etzion, Tuvi

AU - Schwartz, Moshe

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 -

Locality and Availability of Array Codes Constructed from Subspaces

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this