Related papers: Block components of generalized quaternion group c…

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

In this paper, we investigate cyclic code over the ring $\mathbb{F}_{p^k} + v\mathbb{F}_{p^k} + v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$, where $v^{r+1}=v$, $p$ a prime number, $r>1$ and $\gcd(r,p)=1$, we prove as generalisation of…

We show that the quantum coordinate ring of the unipotent subgroup N(w) of a symmetric Kac-Moody group G associated with a Weyl group element w has the structure of a quantum cluster algebra. This quantum cluster structure arises naturally…

The alpha-determinant unifies and interpolates the notion of the determinant and permanent. We determine the irreducible decomposition of the cyclic module of $gl_n(C)$ defined by the alpha-determinant. The degeneracy of the irreducible…

The Clebsch--Gordan coefficients of the Kronecker products of the irreducible representations of the Quaternion Group Q8, of the Generalized Quaternion Groups Q16 and Q32, and of the factor group (Q32 X Q32)/{(1,1),(-1,-1)} are computed as…

Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…

We introduce the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we…

Given a direct sum $A$ of full matrix algebras, if there is a combinatorial interpretation associated with both the dimension of $A$ and the dimensions of the irreducible $A$-modules, then this can be thought of as providing an analogue of…

Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code…

We begin this chapter by introducing the simple algebraic structure of cyclic codes over finite fields. This structure undergoes a series of generalizations to present algebraic descriptions of constacyclic, quasi-cyclic (QC), quasi-twisted…

We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…

Let $p$ be a prime number, $F$ a field of characteristic $p$, and $G$ a cyclic group of order $q =p^a$ for some positive integer $a$. Under these circumstances every indecomposable $F G$-module is cyclic. For indecomposable $F G$-modules…

Group algebras have been used in the context of Coding Theory since the beginning of the latter, but not in its full power. The work of Ferraz and Polcino Milies entitled Idempotents in group algebras and minimal abelian codes (Finite…

In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…

Let $G$ be a classical group with natural module $V$ and Lie algebra $\mathfrak{g}$ over an algebraically closed field $K$ of good characteristic. For rational irreducible representations $f: G \rightarrow \operatorname{GL}(W)$ occurring as…

In this article, we present a concise combinatorial formula for efficiently determining the Wedderburn decomposition of rational group algebra associated with a split metacyclic $p$-group $G$, where $p$ is an odd prime. We also provide a…

The coding problem considered in this work is to construct a linear code $\mathcal{C}$ of given length $n$ and dimension $k<n$ such that a given binary vector $\mathbf{r} \in \mathbb{F}^{n}$ is contained in the code. We study a recent…

We give an explicit and character-free construction of a complete set of orthogonal primitive idempotents of a rational group algebra of a finite nilpotent group and a full description of the Wedderburn decomposition of such algebras. An…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…

Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an…