English
Related papers

Related papers: The Projective General Linear Group $\mathrm{PGL}_…

200 papers

Let $\mathbb{Z}_4$ denote the ring of integers modulo $4$. The Galois ring GR$(4,m)$, which consists of $4^m$ elements, represents the Galois extension of degree $m$ over $\mathbb{Z}_4$. The constructions of codes over $\mathbb{Z}_4$ have…

Information Theory · Computer Science 2025-02-18 Zhexin Wang , Nian Li , Xiangyong Zeng , Xiaohu Tang

We investigate small weight code words of the $p$-ary linear code $\mathcal C_{j,k}(n,q)$ generated by the incidence matrix of $k$-spaces and $j$-spaces of PG$(n,q)$ and its dual, with $q$ a prime power and $0 \leq j < k < n$. Firstly, we…

Combinatorics · Mathematics 2022-09-07 Sam Adriaensen , Lins Denaux

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

Group Theory · Mathematics 2025-10-28 Thomas Michael Keller , Zachary Martin , Alexa Renner , Gabriel Roca , Eric Yu

Let $F=\mathbb{F}_q$ and let $K=\mathbb{F}_{q^m}$ be a finite extension. An additive left group code is a left $FG$-submodule of the group algebra $KG$. In this paper, we introduce projector additive left group codes and restricted…

Rings and Algebras · Mathematics 2026-04-21 Javier de la Cruz

The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…

Number Theory · Mathematics 2007-05-23 I. Mullayeva

Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials being evaluated to yield codewords, are restricted to be homogeneous. The Generalized Hamming Weights (GHW) of a code ${\cal C}$, identify…

Information Theory · Computer Science 2018-06-07 Vinayak Ramkumar , Myna Vajha , P. Vijay Kumar

Previous work on symmetric group equivariant neural networks generally only considered the case where the group acts by permuting the elements of a single vector. In this paper we derive formulae for general permutation equivariant layers,…

Machine Learning · Computer Science 2020-04-09 Erik Henning Thiede , Truong Son Hy , Risi Kondor

The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix…

Information Theory · Computer Science 2008-07-08 Yingquan Wu

We study the irreducible complex representations of general linear groups over principal ideal local rings of length two with a fixed finite residue field. We construct a canonical correspondence between the irreducible representations of…

Representation Theory · Mathematics 2011-04-26 Pooja Singla

We show that the following groups are invariably generated; the group of piecewise projective homeomorphisms of the real line, the group of piecewise $\mathrm{PSL}(2,\mathbb{Z})$ homeomorphisms of the real line, Monod's group…

Group Theory · Mathematics 2023-12-22 Shuhei Maruyama

A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex…

Quantum Physics · Physics 2017-07-04 Yingkai Ouyang

We show a simple geometric procedure for an extension of a loop realized as the image $\Sigma ^{\ast}$ of a sharply transitive section in a subgroup $G^{\ast}$ of the projective linear group $PGL(n-1, \mathbb K)$ to a loop realized as the…

Group Theory · Mathematics 2015-06-30 Agota Figula , Karl Strabach

In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…

Information Theory · Computer Science 2021-11-22 Canze Zhu , Qunying Liao

In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…

Information Theory · Computer Science 2026-05-15 Ankit Yadav , Nilay Kumar Mondal , Ritumoni Sarma

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

Information Theory · Computer Science 2015-03-17 Tadashi Wadayama , Manabu Hagiwara

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani

We consider finite-sample inference for a single regression coefficient in the fixed-design linear model $Y = Z\beta + bX + \varepsilon$, where $\varepsilon\in\mathbb{R}^n$ may exhibit complex dependence or heterogeneity. We develop a group…

Methodology · Statistics 2026-04-20 Zonghan Li , Hongyi Zhou , Zhiheng Zhang

The First Fundamental Theorem of Invariant Theory describes a minimal generating set of the invariant polynomial ring under the action of some group $G$. In this note we give an elementary and direct proof for the $\operatorname{GL}_2(K)$…

Commutative Algebra · Mathematics 2020-10-28 Hana Melanova , Sergey Yurkevich

Let $G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r^3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}_q[G_{(m,3,r)}]$ are called…

Information Theory · Computer Science 2016-06-17 Cao Yonglin , Cao Yuan , Fu Fang-Wei , Gao Jian

In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…

Information Theory · Computer Science 2020-09-16 Hongwei Liu , Xu Pan
‹ Prev 1 4 5 6 7 8 10 Next ›