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 …

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 …

Insertion and deletion (insdel in short) codes are designed to deal with synchronization
errors in communication channels caused by insertions and deletions of message symbols …

In this paper, it is shown that some results in the theory of rank-metric codes over finite fields
can be extended to finite commutative principal ideal rings. More precisely, the rank metric is …

Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65 (8): 4785–4803, 2019)
proposed lifted linearized Reed–Solomon codes as suitable codes for error control in …

Skew polynomials are a class of non-commutative polynomials that have several
applications in computer science, coding theory and cryptography. In particular, skew …

Decoding a Reed-Solomon code can be modeled by a bilinear system which can be solved
by Gröbner basis techniques. We will show that in this particular case, these techniques are …

Résumé Algebraic error-correcting codes respond to numerous needs that emerge from the
world of digital communications and information. The mathematical structure of these …