Journal article
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 …
Authors
Silberstein N; Etzion T; Schwartz M
Journal
IEEE Transactions on Information Theory, Vol. 65, No. 5, pp. 2648–2660
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
May 1, 2019
DOI
10.1109/tit.2018.2876421
ISSN
0018-9448