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 …

We speed up existing decoding algorithms for three code classes in different metrics:
interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the …

We construct $ s $-interleaved linearized Reed--Solomon (ILRS) codes and variants and
propose efficient decoding schemes that can correct errors beyond the unique decoding …

Rank-metric codes recently attract a lot of attention due to their possible application to
network coding, cryptography, space-time coding and distributed storage. An optimal …

Recently, Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that
lifted linearized Reed-Solomon codes are suitable codes for error control in multishot …

We show how to solve a generalised version of the Multi-sequence Linear Feedback Shift-
Register (MLFSR) problem using minimisation of free modules over F [x]. We show how two …

We show that decoding of ℓ ℓ-Interleaved Gabidulin codes, as well as list-ℓ ℓ decoding of
Mahdavifar–Vardy (MV) codes can be performed by row reducing skew polynomial matrices …

Linearized Reed--Solomon (LRS) codes are sum-rank-metric codes that generalize both
Reed--Solomon and Gabidulin codes. We study vertically and horizontally interleaved LRS …

We investigate three paradigms for polynomial-time decoding of Reed–Solomon codes
beyond half the minimum distance: the Guruswami–Sudan algorithm, Power decoding and …

This paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and
develops its application to decoding interleaved Reed-Solomon codes beyond half the …