Codes in the sum-rank metric have attracted significant attention for their applications in
distributed storage systems, multishot network coding, streaming over erasure channels …

The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …

Rank-metric codes are codes consisting of matrices with entries in a finite field, with the
distance between two matrices being the rank of their difference. Codes with maximum size …

In this paper, we properly extend the family of rank-metric codes recently found by
Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021) …

In this paper we investigate the geometric properties of the configuration consisting of a
subspace Γ and a canonical subgeometry Σ in PG (n− 1, qn), with Γ∩ Σ= 0̸. The idea …

This textbook contains the theory and some applications of the rank metric codes developed
by the author and called Gabidulin Codes by the scientific community. A matrix code C is a …

For any admissible value of the parameters n and k there exist [n, k]-Maximum Rank
Distance F q-linear codes. Indeed, it can be shown that if field extensions large enough are …

This paper presents a new construction of error correcting codes which achieves optimal
recovery of a streaming source over a packet erasure channel. The channel model …

We show that the sequence of dimensions of the linear spaces, generated by a given rank-
metric code together with itself under several applications of a field automorphism, is an …

Gabidulin codes are the first general construction of linear codes that are maximum rank
distant (MRD). They have found applications in linear network coding, for example, when the …