Related papers: Construction of minimal non-abelian left group cod…

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…

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an…

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…

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…

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…

We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…

In this paper we give an explicit description of primitive central idempotents of rational group algebras of finite abelian groups using long presentation, and determine their Wedderburn decompositions.

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…

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…

Codes in the generalized quaternion group algebra $\mathbb{F}_q[Q_{4n}]$ are considered. Restricting to char$\mathbb{F}_q \nmid 4n$ the structure of an arbitrary code $C \subseteq \mathbb{F}_q[Q_{4n}]$ is described via the Wedderburn…

This work concerns finite free complexes over commutative noetherian rings, in particular over group algebras of elementary abelian groups. The main contribution is the construction of complexes such that the total rank of their underlying…

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. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…

We give a simple construction of codes from left ideals in group algebras of certain dihedral groups and give an example to show that they can produce codes with weights equal to those of the best known codes of the same length.

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…

It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\mathds{D}_6$ and show that the performance of these codes is superior to the performance…

We develop the idempotent theory for algebras over a class of semigroups called left regular bands of groups (LRBGs), which simultaneously generalize group algebras of finite groups and left regular band (LRB) algebras. Our techniques weave…

In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…