On minimal easily computable dimension group algebras, and group codes

2023/02/20 by García-Claro, E. J.
#FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Information Theory (cs.IT) #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.2302.10064

Abstract

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples illustrating the main results are provided.

Related

• On easily computable indecomposable dimension group algebras, and group codes
• On the dimension of ideals in group algebras, and group codes
• Computing the dimension of ideals in group algebras, with an application\n to coding theory
• Group Algebra and Coding Theory
• Minimal group codes over alternating groups