English
Related papers

Related papers: Relative projective group codes over chain rings

200 papers

A unital $\ell$-group is an abelian group equipped with a translation invariant lattice-order and with a distinguished strong unit, i.e. an element whose positive integer multiples eventually dominate every element of $G$.If $X$ is a…

Rings and Algebras · Mathematics 2014-05-29 Leonardo Manuel Cabrer

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

Projective Reed-Muller codes(PRM codes) are constructed from the family of projective hypersurfaces of a fixed degree over a finite field $\F_q$. In this paper, we completely determine the minimal distance of the hull of any Projective…

Information Theory · Computer Science 2024-10-11 Yufeng Song , Jinquan Luo

We give a new proof for the description of the blocks in the category of representations of a reductive algebraic group $\mathbf{G}$ over a field of positive characteristic $\ell$ (originally due to Donkin), by working in the Satake…

Representation Theory · Mathematics 2026-04-02 Emilien Zabeth

We give an alternative proof of the formula for the minimum distance of a projective Reed-Muller code of an arbitrary order. It leads to a complete characterization of the minimum weight codewords of a projective Reed-Muller code. This is…

Information Theory · Computer Science 2023-09-29 Sudhir R. Ghorpade , Rati Ludhani

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Information Theory · Computer Science 2022-12-08 Chao Liu , Dabin Zheng , Xiaoqiang Wang

We develop an elementary theory of partially additive rings as a foundation of ${\mathbb F}_1$-geometry. Our approach is so concrete that an analog of classical algebraic geometry is established very straightforwardly. As applications, (1)…

Algebraic Geometry · Mathematics 2022-06-14 Shingo Okuyama

Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…

Information Theory · Computer Science 2021-03-26 Ziling Heng , Dexiang Li , Jiao Du , Fuling Chen

Let $RG$ be the gruop ring of the group $G$ over ring $R$ and $\mathscr{U}(RG)$ be its unit group. Finding the structure of the unit group of a finite group ring is an old topic in ring theory. In, G. Tang et al: Unit Groups of Group…

Rings and Algebras · Mathematics 2020-04-08 Ali Ashja'

Let $\ell$ be a prime. If ${\mathbf G} $ is a compact connected Lie group, or a connected reductive algebraic group in characteristic different from $\ell$, and $\ell$ is a good prime for ${\mathbf G}$, we show that the number of weights of…

Representation Theory · Mathematics 2023-03-13 Radha Kessar , Gunter Malle , Jason Semeraro

A binary $[98280, 24, 47104]_2$ projective two-weight code related to the sporadic simple group ${\rm Co}_1$ of Conway is constructed as a faithful and absolutely irreducible submodule of the permutation module induced by the primitive…

Combinatorics · Mathematics 2024-09-10 Bernardo G. Rodrigues

In this article we describe the general and special projectivity groups for all irreducible residues of all thick, irreducible, spherical buildings of type $ \mathsf{B_{n}}$, $ \mathsf{C_{n}}$ and $\mathsf{F_4}$, and rank at least 3. This…

Group Theory · Mathematics 2025-07-04 Sira Busch , Hendrik Van Maldeghem

Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…

Information Theory · Computer Science 2024-05-31 Wei Lu , Qingyao Wang , Xiaoqiang Wang , Dabin Zheng

\input amssym.def \input amssym.tex Let $G$ be a connected algebraic reductive group over an algebraic closure of a prime field ${\Bbb F}_p$, defined over ${\Bbb F}_q$ thanks to a Frobenius $F$. Let $\ell$ be a prime different from $p$. Let…

Group Theory · Mathematics 2013-12-03 Michel E. Enguehard

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…

Information Theory · Computer Science 2016-12-02 Yan Liu , Minjia Shi , Patrick Solé

In this paper we investigate some dual algebraic-geometric codes associated with the Giulietti-Korchm\'aros maximal curve. We compute the minimum distance and the minimum weight codewords of such codes and we investigate the generalized…

Information Theory · Computer Science 2019-09-19 Edoardo Ballico , Matteo Bonini

In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.

Information Theory · Computer Science 2014-04-09 Yan Liu

We prove a rigidity theorem for morphisms from products of open subschemes of the projective line into solvable groups not containing a copy of $\Ga$ (for example, wound unipotent groups). As a consequence, we deduce several structural…

Algebraic Geometry · Mathematics 2025-09-17 Zev Rosengarten

Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…

Group Theory · Mathematics 2018-05-28 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

Locally recoverable codes deal with the task of reconstructing a lost symbol by relying on a portion of the remaining coordinates smaller than an information set. We consider the case of codes over finite chain rings, generalizing known…

Information Theory · Computer Science 2024-01-11 Giulia Cavicchioni , Eleonora Guerrini , Alessio Meneghetti
‹ Prev 1 4 5 6 7 8 10 Next ›