On minimal easily computable dimension group algebras, and group codes
E. J. García-Claro · arXiv (Cornell University) · 2023
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.