English
Related papers

Related papers: Group code structures on affine-invariant codes

200 papers

We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…

Group Theory · Mathematics 2013-01-29 Eldho K. Thomas , Frederique Oggier

Given a finite group $G$ and an extension of finite chain rings $S|R$, one can consider the group rings $\mathscr{S} = S[G]$ and $\mathscr{R} = R[G]$. The group ring $\mathscr{S}$ can be viewed as an $R$-bimodule, and any of its…

Information Theory · Computer Science 2025-08-12 Maryam Bajalan , Javier de la Cruz , Alexandre Fotue Tabue , Edgar Martínez-Moro

Let $G$ be a group. A function $G\rightarrow G$ of the form $x\mapsto x^{\alpha}g$ for a fixed automorphism $\alpha$ of $G$ and a fixed $g\in G$ is called an affine map of $G$. In this paper, we study finite groups $G$ with an affine map of…

Group Theory · Mathematics 2021-06-21 Alexander Bors

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Group Theory · Mathematics 2016-04-29 P. Devi , R. Rajkumar

In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…

Information Theory · Computer Science 2023-01-02 Gülsüm Gözde Yılmazgüç , Javier de la Cruz , Edgar Martínez-Moro

Linear forms in logarithms over connected commutative algebraic groups over the algebraic numbers field have been studied widely. However, the theory of linear forms in logarithms over noncommutative algebraic groups have not been developed…

Number Theory · Mathematics 2015-12-01 Mario Huicochea

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Information Theory · Computer Science 2022-09-29 Angelo Marotta

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

Combinatorics · Mathematics 2012-10-23 Tuvi Etzion , Alexander Vardy

We investigate the theory of affine group schemes over a symmetric tensor category, with particular attention to the tangent space at the identity. We show that this carries the structure of a restricted Lie algebra, and can be viewed as…

Representation Theory · Mathematics 2025-07-04 Dave Benson , Julia Pevtsova

In this paper, we shall use a method based on the theory of extensions of left-symmetric algebras to classify complete left-invariant affine real structures on solvable non-unimodular three-dimensional Lie groups.

Differential Geometry · Mathematics 2014-10-28 Mohammed Guediri , Kholoud Al-Balawi

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…

Combinatorics · Mathematics 2020-05-13 G. Longobardi , G. Lunardon , R. Trombetti , Y. Zhou

In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…

Rings and Algebras · Mathematics 2021-03-02 Kirill V. Vedenev , Vladimir M. Deundyak

A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…

Information Theory · Computer Science 2013-03-26 Cristiano Torezzan , João E. Strapasson , Sueli I. R. Costa , Rogerio M. Siqueira

A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also…

Algebraic Geometry · Mathematics 2015-05-13 S. N. Fedotov

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

Commutative Algebra · Mathematics 2016-04-01 Chiara Marcolla , Emmanuela Orsini , Massimiliano Sala

We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…

Information Theory · Computer Science 2017-03-08 John B. Little

A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…

Information Theory · Computer Science 2019-03-20 Weiqiong Wang , Yan Wang

We give, in Sections 2 and 3, an english translation of: {\it Classes g\'en\'eralis\'ees invariantes}, J. Math. Soc. Japan, 46, 3 (1994), with some improvements and with notations and definitions in accordance with our book: {\it Class…

Number Theory · Mathematics 2021-08-24 Georges Gras

Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite…

Combinatorics · Mathematics 2017-01-10 Michela Ceria

The codegree of an irreducible character $\chi$ of a finite group $G$ is defined as $|G:\ker\chi|/\chi(1)$. The codegree graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertices are the prime divisors of $|G|$, where two distinct…

Group Theory · Mathematics 2025-10-20 Jiyong Chen , Ni Du , Leyi Li