Related papers: Group Algebra and Coding Theory
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…
An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…
We give a further extension and generalization of Dedekind's theorem over those presented by Yamaguchi. In addition, we give two corollaries on irreducible representations of finite groups and a conjugation of the group algebra of the…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
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…
In this paper, some properties and applications of MV-algebras are provided. We define a Fibonacci sequence in an MV-algebra and we prove that such a stationary sequence gives us an idempotent element. Taking into account of the…
We study the general theory of Frobenius algebras with group actions. These structures arise when one is studying the algebraic structures associated to a geometry stemming from a physical theory with a global finite gauge group, i.e.…
The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup…
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…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These codes are closely related to Reed-Muller codes because both…
This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…
A finite-dimensional Lie algebra $L$ over a field $F$ is called an $A$-algebra if all of its nilpotent subalgebras are abelian. This is analogous to the concept of an $A$-group: a finite group with the property that all of its Sylow…
In "A note on generalized Clifford algebras and representations" (Caenepeel, S.; Van Oystaeyen, F., Comm. Algebra 17 (1989) no. 1, 93--102.) generalized Clifford algebras were introduced via Clifford representations; these correspond to…
We explore the graded and filtered formality properties of finitely generated groups by studying the various Lie algebras over a field of characteristic 0 attached to such groups, including the Malcev Lie algebra, the associated graded Lie…
Frame theory has been a popular subject in the design of structured signals and codes in recent years, with applications ranging from the design of measurement matrices in compressive sensing, to spherical codes for data compression and…
Split group codes are a class of group algebra codes over an abelian group. They were introduced in 2000 by Ding, Kohel and Ling as a generalization of the cyclic duadic codes. For a prime power q and an abelian group G of order n such that…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
Let $ \mathbb{A}$ be a cellular algebra over a field $\mathbb{F}$ with a decomposition of the identity $ 1_{\mathbb{A}} $ into orthogonal idempotents $ e_i$, $i \in I$ (for some finite set $I$) satisfying some properties. We describe the…