English
Related papers

Related papers: Automorphism groups of Gabidulin-like codes

200 papers

Let $k$ be an algebraically closed field of characteristic zero, $F$ be an algebraically closed extension of $k$ of transcendence degree one, and $G$ be the group of automorphisms over $k$ of the field $F$. The purpose of this note is to…

Algebraic Geometry · Mathematics 2009-04-07 M. Rovinsky

Twisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study three classes of twisted Gabidulin codes with different twists. Moreover, we establish necessary and sufficient…

Information Theory · Computer Science 2025-09-17 Ran Li , Fang-Wei Fu , Weijun Fang

In this note, we provide a description of the elements of minimum rank of a generalized Gabidulin code in terms of Grassmann coordinates. As a consequence, a characterization of linearized polynomials of rank at most $n-k$ is obtained, as…

Information Theory · Computer Science 2022-03-15 Luca Giuzzi , Guglielmo Lunardon

Let $\mathcal{C}$ be a set of $m$ by $n$ matrices over $\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\in \mathcal{C}$. Suppose that $m\leqslant n$. If $\#\mathcal{C}= q^{n(m-d+1)}$, then $\mathcal{C}$ is a…

Combinatorics · Mathematics 2018-05-29 Guglielmo Lunardon , Rocco Trombetti , Yue Zhou

For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\mathbb F}_q$-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are…

Combinatorics · Mathematics 2019-04-16 Luca Giuzzi , Ferdinando Zullo

Four constructions for Ferrers diagram rank-metric (FDRM) codes are presented. The first one makes use of a characterization on generator matrices of a class of systematic maximum rank distance codes. By introducing restricted Gabidulin…

Combinatorics · Mathematics 2019-10-10 Shuangqing Liu , Yanxun Chang , Tao Feng

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

Information Theory · Computer Science 2010-06-22 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…

Information Theory · Computer Science 2026-01-23 Alessandro Neri , Ferdinando Zullo

We prove that if $f:X \rightarrow A$ is a morphism from a smooth projective variety $X$ to an abelian variety $A$ over a number field $K$, and $G$ is a subgroup of automorphisms of $X$ satisfying certain properties, and if a prime $p$…

Number Theory · Mathematics 2024-12-18 Seokhyun Choi , Bo-Hae Im

The automorphism group of the Galois covering induced by a pluri-canonical generic covering of a projective space is investigated. It is shown that by means of such coverings one obtains, in dimensions one and two, serieses of specific…

Algebraic Geometry · Mathematics 2007-09-03 V. Kharlamov , Vik. Kulikov

(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…

Information Theory · Computer Science 2011-02-16 Antonia Wachter , Vladimir Sidorenko , Martin Bossert , Victor Zyablov

Left and right idealizers are important invariants of linear rank-distance codes. In the case of maximum rank-distance (MRD for short) codes in $\mathbb{F}_q^{n\times n}$ the idealizers have been proved to be isomorphic to finite fields of…

Combinatorics · Mathematics 2020-09-17 Bence Csajbók , Giuseppe Marino , Olga Polverino , Yue Zhou

Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…

Strongly Correlated Electrons · Physics 2026-05-12 Po-Shen Hsin , Ryohei Kobayashi

Recently, the first author classified finite groups obtained as automorphism groups of smooth plane curves of degree $d \ge 4$ into five types. He gave an upper bound of the order of the automorphism group for each types. For one of them,…

Algebraic Geometry · Mathematics 2017-09-18 Takeshi Harui , Kei Miura , Akira Ohbuchi

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…

Number Theory · Mathematics 2020-07-07 José Alves Oliveira

We show all the possible structures of finite subgroups of the automorphism groups of elliptic curves. Here the automorphism means the biholomorphic transformation. Using the result, we determine every Galois group G at outer Galois point…

Number Theory · Mathematics 2011-05-10 Mitsunori Kanazawa , Hisao Yoshihara

For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…

Dynamical Systems · Mathematics 2022-04-29 Julia Cai , Benjamin Hutz , Leo Mayer , Max Weinreich

Assume that $X$ and $Y$ are arithmetic schemes, i.e., integral schemes of finite types over $Spec(\mathbb{Z})$. Then $X$ is said to be quasi-galois closed over $Y$ if $X$ has a unique conjugate over $Y$ in some certain algebraically closed…

Algebraic Geometry · Mathematics 2009-10-10 Feng-Wen An

Let $G$ be a finite classical group of Lie type of rank $\ell$, defined over a field of characteristic $p>2$. In this work, we classify the irreducible representations of $G$ whose dimensions are bounded by a constant proportional to…

Representation Theory · Mathematics 2025-11-19 Luis Gutiérrez Frez , Adrian Zenteno

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo