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 …

This paper investigates the construction of rankmetric codes with specified Ferrers diagram
shapes. These codes play a role in the multilevel construction for subspace codes. A …

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 …

Cryptosystems based on codes in the rank metric were introduced in 1991 by Gabidulin,
Paramanov, and Tretjakov (GPT) and have been studied as a promising alternative to …

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 …

We introduce the class of partition-balanced families of codes, and show how to exploit their
combinatorial invariants to obtain upper and lower bounds on the number of codes that have …

This paper considers fast algorithms for operations on linearized polynomials. We propose a
new multiplication algorithm for skew polynomials (a generalization of linearized …

We propose a REinforced modified Dual-Ouroboros based on Gabidulin codes, shortly
called REDOG. This is a code-based cryptosystem based on the well-known rank metric …

In this paper we study properties and invariants of matrix codes endowed with the rank
metric and relate them to the covering radius. We introduce new tools for the analysis of rank …

Codes in rank metric have a wide range of applications. To construct such codes with better
list-decoding performance explicitly, it is of interest to investigate the listdecodability of …