English
Related papers

Related papers: Rank metric and Gabidulin codes in characteristic …

200 papers

Gabidulin codes over fields of characteristic zero were recently constructed by Augot et al., whenever the Galois group of the underlying field extension is cyclic. In parallel, the interest in sparse generator matrices of Reed-Solomon and…

Information Theory · Computer Science 2020-05-01 Hikmet Yildiz , Netanel Raviv , Babak Hassibi

Quantum systems in which the position and momentum take values in the ring ${\cal Z}_d$ and which are described with $d$-dimensional Hilbert space, are considered. When $d$ is the power of a prime, the position and momentum take values in…

Quantum Physics · Physics 2007-05-23 A. Vourdas

We prove that the arboreal Galois representation attached to a large class of quadratic polynomials defined over a field of rational functions in characteristic zero has finite index in the full automorphism group of the associated preimage…

Number Theory · Mathematics 2014-10-28 Wade Hindes

We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…

Number Theory · Mathematics 2017-05-02 Sophie Marques , Kenneth Ward

We consider linear rank-metric codes in $\mathbb F_{q^m}^n$. We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large…

Information Theory · Computer Science 2018-03-13 Alessandro Neri , Anna-Lena Horlemann-Trautmann , Tovohery Randrianarisoa , Joachim Rosenthal

We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix…

Information Theory · Computer Science 2017-10-06 Elisa Gorla , Alberto Ravagnani

We introduce a new technique to construct rank-metric codes using the arithmetic theory of Drinfeld modules over global fields, and Dirichlet Theorem on polynomial arithmetic progressions. Using our methods, we obtain a new infinite family…

Information Theory · Computer Science 2026-01-15 Luca Bastioni , Mohamed O. Darwish , Giacomo Micheli

This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the decoding radius. Using this decoder, we provide polynomial…

Cryptography and Security · Computer Science 2021-11-22 Maxime Bombar , Alain Couvreur

This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press. The chapter gives an introduction to the mathematical theory of rank-metric codes. Treated topics include:…

Information Theory · Computer Science 2019-02-08 Elisa Gorla

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 subspace metric, and linearized Reed-Solomon codes in the…

Information Theory · Computer Science 2021-03-11 Hannes Bartz , Thomas Jerkovits , Sven Puchinger , Johan Rosenkilde

We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…

Information Theory · Computer Science 2023-12-12 Anina Gruica , Altan B. Kilic , Alberto Ravagnani

Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$…

Algebraic Geometry · Mathematics 2024-03-28 Raju Krishnamoorthy , Yeuk Hay Joshua Lam

We characterize the generator matrix in standard form of generalized Gabidulin codes. The parametrization we get for the non-systematic part of this matrix coincides with the $q$-analogue of generalized Cauchy matrices, leading to the…

Information Theory · Computer Science 2020-01-29 Alessandro Neri

This article contains a complete proof of Gabrielov's rank Theorem, a fundamental result in the study of analytic map germs. Inspired by the works of Gabrielov and Tougeron, we develop formal-geometric techniques which clarify the difficult…

Complex Variables · Mathematics 2021-06-30 André Belotto da Silva , Octave Curmi , Guillaume Rond

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Information Theory · Computer Science 2015-02-17 Bryan Hernandez , Virgilio Sison

Motivic local systems over a curve in finite characteristic form a countable set endowed with an action of the absolute Galois group of rational numbers commuting with the Frobenius map. I will discuss three series of conjectures about such…

Algebraic Geometry · Mathematics 2007-06-13 Maxim Kontsevich

We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied…

Information Theory · Computer Science 2013-11-01 Jérôme Ducoat

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

Combinatorics · Mathematics 2021-02-17 László Lovász , Balázs Szegedy

The tensor rank of some Gabidulin codes of small dimension is investigated. In particular, we determine the tensor rank of any rank metric code equivalent to an $8$-dimensional $\mathbb{F}_q$-linear generalized Gabidulin code in…

Information Theory · Computer Science 2022-01-21 Daniele Bartoli , Giovanni Zini , Ferdinando Zullo

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Group Theory · Mathematics 2025-12-23 Zeev Dvir