Related papers: Rank metric and Gabidulin codes in characteristic …

Let $\mathbb{F}_q$ denote the finite field with $q=p^\lambda$ elements. Maximum Rank-metric codes (MRD for short) are subsets of $M_{m\times n}(\mathbb{F}_q)$ whose number of elements attains the Singleton-like bound. The first MRD codes…

A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…

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 Reed--Solomon codes. In this paper, we provide bounds on the list…

(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is…

We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models we consider an infinite family of linear maximum rank distance codes obtained by puncturing…

We prove a generalization of Gabrielov's rank theorem for families of rings of power series which we call W-temperate. Examples include the families of complex analytic functions and of Eisenstein series. As a Corollary, we provide rank…

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

We determine the automorphism group of Gabidulin codes of full length and characterise when these codes are equivalent to self-dual codes.

In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank…

Let $A$ be an abelian variety defined over a number field and let $G$ denote its Sato-Tate group. Under the assumption of certain standard conjectures on $L$-functions attached to the irreducible representations of $G$, we study the…

Wachter-Zeh in [42], and later together with Raviv [31], proved that Gabidulin codes cannot be efficiently list decoded for any radius $\tau$, providing that $\tau$ is large enough. Also, they proved that there are infinitely many choices…

In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…

We introduce a notion of rank completion for bi-modules over a finite tracial von Neumann algebra. We show that the functor of rank completion is exact and that the category of complete modules is abelian with enough projective objects.…

In [Frobenius1896] it was shown that many important properties of a finite group could be examined using formulas involving the character ratios of group elements, i.e., the trace of the element acting in a given irreducible representation,…

In this work we present a new criterion to check if a given rank-metric code is a maximum rank distance (MRD) code. Moreover, we derive a criterion to check if a given MRD code is a generalized Gabidulin code. We then use these results to…

This paper presents an algorithm for decoding homogeneous interleaved codes of high interleaving order in the rank metric. The new decoder is an adaption of the Hamming-metric decoder by Metzner and Kapturowski (1990) and guarantees to…

In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with…

Rank-metric codes have been a central topic in coding theory due to their theoretical and practical significance, with applications in network coding, distributed storage, crisscross error correction, and post-quantum cryptography. Recent…

We construct an explicit family of linear rank-metric codes over any field ${\mathbb F}_h$ that enables efficient list decoding up to a fraction $\rho$ of errors in the rank metric with a rate of $1-\rho-\epsilon$, for any desired $\rho \in…

This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors. Space-symmetric errors are additive error matrices that have the property that their column and row spaces are…