Related papers: Group codes over fields are asymptotically good

We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.

We classify, up to isomorphism, all gradings by an arbitrary abelian group on simple finitary Lie algebras of linear transformations (special linear, orthogonal and symplectic) on infinite-dimensional vector spaces over an algebraically…

We determine the image of the braid groups inside the Temperley-Lieb algebras, defined over finite field, in the semisimple case, and for suitably large (but controlable) order of the defining (quantum) parameter. We also prove that, under…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an…

Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of $2^\beta$-good…

A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…

We classify gradings on matrix algebras by a finite abelian group. A grading is called good if all elementary matrices are homogeneous. For cyclic groups, all gradings on a matrix algebra over an algebraically closed field are good. We can…

For quasifields, the concept of parastrophy is slightly weaker than isotopy. Parastrophic quasifields yield isomorphic translation planes but not conversely. We investigate the right multiplication groups of finite quasifields. We classify…

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and ndecomposable group codes, we prove that every MDS non trivial code, every perfect non…

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…

This paper, together with a forthcoming paper by the author and Seitz, proves the Margulis-Platonov conjecture concerning the normal subgroup structure of algebraic groups over number fields, in the case of inner forms of anisotropic groups…

A number is perfect if it is the sum of its proper divisors; here we call a finite group `perfect' if its order is the sum of the orders of its proper normal subgroups. (This conflicts with standard terminology but confusion should not…

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than 1 to exactly one vertex of $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code…

We describe solutions to the problem of elementary classification in the class of group algebras of free groups. We will show that unlike free groups, two group algebras of free groups over infinite fields are elementarily equivalent if and…

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an…

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…