Related papers: Block components of generalized quaternion group c…
In this paper we obtain the Wedderburn-Artin decomposition of a semisimple group algebra associated to a direct product of finite groups. We also provide formulae for the number of all possible group codes, and their dimensions, that can be…
In this article, we show explicitly the Wedderburn decomposition of the metacyclic group algebra $\mathbb F_qG$, where $G$ has a cyclic subgroup of index 2 and $\gcd(|G|,q)=1$. We also construct the complete set of central and left…
Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…
Let $\mathbb F_q$ be a finite field, where $q$ is an odd prime power. Let $R=\mathbb{F}_q+u\mathbb{F}_q+v\mathbb{F}_q+uv\mathbb F_q$ with $u^2=u,v^2=v,uv=vu$. In this paper, we study the algebraic structure of $(\theta, \Theta)$-cyclic…
In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
An irreducible ordinary character of a finite reductive group is called quadratic unipotent if it corresponds under Jordan decomposition to a semisimple element $s$ in a dual group such that $s^2=1$. We prove that there is a bijection…
In this work we show that every minimal code in a semisimple group algebra $\mathbb{F}_qG$ is essential if $G$ is a simple group. Since the alternating group $A_n$ is simple if $n=3$ or $n\geq 5$, we present some examples of minimal codes…
In this paper,we show some $[2n,2n-2,3]$ and $[2n,2n-3,4]$ MDS codes over dihedral codes $F_qD_{2n}$,in the case $n$ is odd and char$F_q$$\nmid$$\lvert G \rvert$ and $F_q$ contains primitive root of exponent $\lvert G \rvert$ i.e $F_q$ is…
Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…
Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…
Based on good algebraic structures and practicabilities, generalized quasi-cyclic (GQC) codes play important role in coding theory. In this paper, we study some results on GQC codes over $\mathbb{Z}_4$ including the normalized generating…
In this article, we show the relation between the irreducible idempotents of the cyclic group algebra $\mathbb F_qC_n$ and the central irreducible idempotents of the group algebras $\mathbb F_qD_{2n}$, where $\mathbb F_q$ is a finite field…
We give a detailed account of a combinatorial construction, due to Cherednik, of cyclic generators for irreducible modules of the affine Hecke algebra of the general linear group with generic parameter q.
In this paper we introduce the notion of cyclic ($f(t),\sigma,\delta$)-codes for $f(t)\in \Ore$. These codes generalize the $\theta$-codes as introduced by D. Boucher, F. Ulmer, W. Geiselmann \cite{BGU}. We construct generic and control…
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…
In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
Let ${\bf G}$ be a connected reductive algebraic group defined over the finite field $\mathbb{F}_q$ with $q$ elements. Let $\Bbbk$ be a field such that $\op{char} \Bbbk \ne \op{char} \mathbb{F}_q$. In this paper, we study the extensions of…
We use a combinatorial result relating the discriminant of the cycle pairing on a weighted finite graph to the eigenvalues of its Laplacian to deduce a formula for the orders of component groups of Jacobians of modular curves arising from…