On minimal easily computable dimension group algebras, and group codes
Representation Theory
2024-08-08 v3 Information Theory
Group Theory
math.IT
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.
Cite
@article{arxiv.2302.10064,
title = {On minimal easily computable dimension group algebras, and group codes},
author = {E. J. García-Claro},
journal= {arXiv preprint arXiv:2302.10064},
year = {2024}
}
Comments
The results in this manuscript were generalized and expanded in the work entitled "On easily computable indecomposable dimension group algebras, and group codes" (arXiv:2404.05775v1)