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 …

So far, there is no polynomial-time list decoding algorithm (beyond half the minimum
distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of …

Gabidulin codes are the analogues of Reed–Solomon codes in rank metric and play an
important role in various applications. In this contribution, a method for efficient decoding of …

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 …

An efficient algorithm which synthesizes all shortest skew-feedback shift-registers (defined in
the paper) generating L sequences of varying length over a field is derived and its …

In this paper, we consider an interpolation-based decoding algorithm for a large family of
maximum rank distance codes, known as the additive generalized twisted Gabidulin codes …

An interleaved Gabidulin code is the direct sum of ℓ Gabidulin codes. We propose an
efficient decoding algorithm that corrects with high probability errors of rank up to (ℓ/ℓ+ 1)(d …

A skew-feedback shift-register is a generalization of a linear-feedback shift-register and can
be applied in decoding (interleaved) Reed–Solomon codes or Gabidulin codes beyond half …

This paper presents encoding and decoding algorithms for several families of optimal rank
metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian …

This dissertation considers constructions and decoders of several evaluation codes in
Hamming and rank metric. Codes in Hamming metric have been studied since the 1950s …