English
Related papers

Related papers: Automorphism groups of Gabidulin-like codes

200 papers

Let $K/F$ be a finite Galois extension of number fields. It is well known that the Tchebotarev density theorem implies that an irreducible, finitely ramified $p$-adic representation $\rho$ of the absolute Galois group of $K$ is determined…

Number Theory · Mathematics 2018-06-25 Dinakar Ramakrishnan

Gabidulin codes can be seen as the rank-metric equivalent of Reed-Solomon codes. It was recently proven, using subspace polynomials, that Gabidulin codes cannot be list decoded beyond the so-called Johnson radius. In another result, cyclic…

Information Theory · Computer Science 2016-10-17 Netanel Raviv , Antonia Wachter-Zeh

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 flat rank of a totally disconnected locally compact group G, denoted flat-rk(G), is an invariant of the topological group structure of G. It is defined thanks to a natural distance on the space of compact open subgroups of G. For a…

Group Theory · Mathematics 2007-05-23 Udo Baumgartner , Bertrand Remy , George A. Willis

This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage system. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any…

Information Theory · Computer Science 2018-01-19 Alessandro Neri , Anna-Lena Horlemann-Trautmann

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

Combinatorics · Mathematics 2021-03-24 William M. Kantor

In \cite{GQ2008} R. Gow and R. Quinlan have cast a new look on the endomorphism algebra of a $K$-vector space $V$ of dimension $n$ assuming that $K$ has a Galois extension $L$ of degree $n$. In this approach the $K$-space $L$ may serve as a…

Representation Theory · Mathematics 2024-05-29 Ashish Gupta , Sugata Mandal

We study the groups in the unit filtration of a finite abelian extension K of the field of p-adic numbers. We determine explicit generators of these groups as modules over the pro-p group ring of the Galois group of K over the p-adic…

Number Theory · Mathematics 2014-02-18 Romyar T. Sharifi

The special linear groups, the mapping class groups of surfaces, the outer autormorphism groups of free groups appear in numerous domains. Their analogies, developped in particular in K. Vogtmann's work, have been written about a lot. In…

Group Theory · Mathematics 2011-10-04 Frédéric Paulin

Let $K$ be a field, and let $f\in K(z)$ be a rational function of degree $d\geq 2$. The Galois group of the field extension generated by the preimages of $x_0\in K$ under all iterates of $f$ naturally embeds in the automorphism group of an…

Number Theory · Mathematics 2024-04-08 Robert L. Benedetto , William DeGroot , Xinyu Ni , Jesse Seid , Annie Wei , Samantha Winton

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

Combinatorics · Mathematics 2024-01-17 Mehdi Makhul , Josef Schicho , Audie Warren

The automorphisms of free groups with boundaries form a family of groups A_{n,k} closely related to mapping class groups, with the standard automorphisms of free groups as A_{n,0} and (essentially) the symmetric automorphisms of free groups…

Geometric Topology · Mathematics 2014-10-01 Craig A. Jensen , Nathalie Wahl

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

Combinatorics · Mathematics 2018-10-16 William M. Kantor

A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…

Information Theory · Computer Science 2009-03-06 Jose Joaquin Bernal , Angel del Rio , Juan Jacobo Simon

In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the…

Information Theory · Computer Science 2017-04-10 Nicola Durante , Alessandro Siciliano

Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism F, we denote by k(X)^F its field of invariants, i.e. the set of rational functions f on X such that f(F)=f. Let n(F)…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Bonnet

We prove that over totally real fields, the $p$-adic Galois representations attached to non-self-dual regular algebraic cuspidal automorphic representations of $\mathrm{GL}(4)$ are irreducible. We then develop the theory of extra-twists in…

Number Theory · Mathematics 2026-03-23 Alireza Shavali

We prove new results concerning the additive Galois module structure of certain wildly ramified finite non-abelian extensions of Q. In particular, when K/Q is a Galois extension with Galois group G isomorphic to A4, S4 or A5, we give…

Number Theory · Mathematics 2022-04-12 Fabio Ferri

For any admissible value of the parameters there exist Maximum Rank distance (shortly MRD) $\mathbb{F}_{q^n}$-linear codes of $\mathbb{F}_q^{n\times n}$. It has been shown in \cite{H-TNRR} (see also \cite{ByrneRavagnani}) that, if field…

Information Theory · Computer Science 2019-04-08 Luca Giuzzi , Ferdinando Zullo