Galois geometries and coding theory are two research areas which have been interacting
with each other for many decades. From the early examples linking linear MDS codes with …

There has been much recent interest in Private information Retrieval (PIR) in models where
a database is stored across several servers using coding techniques from distributed …

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 …

There has been much recent interest in private information retrieval (PIR) in models where a
database is stored across several servers using coding techniques from distributed storage …

A code is said to be equidistant if the distance between any two distinct codewords of the
code is the same. In this paper, we have studied equidistant single-orbit cyclic and quasi …

Recovery sets for vectors and subspaces are important in the construction of distributed
storage system codes. These concepts are also interesting in their own right. In this paper …

A code is said to be equidistant if the distance between any two distinct codewords of the
code is the same. In this paper, we have studied equidistant single-orbit cyclic and quasi …

Storage codes are used to ensure reliable storage of data in distributed systems; functional
repair codes have the additional property that individual storage nodes that fail may be …

Nowadays error-correcting codes are widely used in communication systems, returning
pictures from deep space, designing registration numbers, and storage of data in memory …

We extend the notion of locality from the Hamming metric to the rank and subspace metrics.
Our main contribution is to construct a class of array codes with locality constraints in the …