Locality and Availability of Array Codes Constructed from Subspaces

Natalia Silberstein, Tuvi Etzion, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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 languageEnglish
Article number8493531
Pages (from-to)2648-2660
Number of pages13
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - 1 May 2019


  • Locally repairable codes
  • availability
  • distributed storage
  • q-analog

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Locality and Availability of Array Codes Constructed from Subspaces'. Together they form a unique fingerprint.

Cite this