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

Abstract Reed–Solomon codes and Gabidulin codes have maximum Hamming distance and
maximum rank distance, respectively. A general construction using skew polynomials, called …

Multishot network coding is considered in a worst-case adversarial setting in which an
omniscient adversary with unbounded computational resources may inject erroneous …

This paper investigates the theory of sum-rank-metric codes for which the individual matrix
blocks may have different sizes. Various bounds on the cardinality of a code are derived …

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew
polynomial ring. This approach generalizes at the same time the skew group algebra setting …

Many current and emerging applications require low-latency communication, including
interactive voice and video communication, multiplayer gaming, multiperson …

The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory
over fields. It measures the error-correcting capability of codes in multishot matrix …

The tensor product of one code endowed with the Hamming metric and one endowed with
the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric …

In this work, cyclic-skew-cyclic codes and sum-rank BCH codes are introduced. Cyclic-skew-
cyclic codes are characterized as left ideals of a suitable non-commutative finite ring …

Linearized Reed-Solomon (LRS) codes are a class of evaluation codes based on skew
polynomials. They achieve the Singleton bound in the sum-rank metric, and therefore are …