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 consider Reed-Solomon (RS) codes whose evaluation points belong to a subfield, and
give a linear-algebraic list decoding algorithm that can correct a fraction of errors …

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 …

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 construct an explicit family of Fh-linear rankmetric codes over any field Fh that enables
efficient list-decoding up to a fraction p of errors in the rank metric with a rate of 1-ρ-e, for any …

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 …

A new interpolation-based decoding principle for interleaved Gabidulin codes is presented.
The approach consists of two steps: First, a multi-variate linearized polynomial is constructed …

Recently, codes in the sum-rank metric attracted attention due to several applications in eg
multishot network coding, distributed storage and quantum-resistant cryptography. The sum …

This book provides a consolidated view of the various network coding techniques to be
implemented at the design of the wireless networks for improving its overall performance. It …

The sum-rank metric is a hybrid between the Hamming metric and the rank metric and
suitable for error correction in multishot network coding and distributed storage as well as for …