The Mathematical Theory of Coding
The Mathematical Theory of Coding
Minimal Codes of Prime-Power Length
Finite Fields and Their Applications
Minimal Cyclic Codes of Length 2pn
Finite Fields and Their Applications
Some cyclic codes of length 2pn
Designs, Codes and Cryptography
Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotents
Finite Fields and Their Applications
| Hi-index | 0.00 |
We compute the number of simple components of a semisimple finite abelian group algebra and determine all cases where this number is minimal; i.e. equal to the number of simple components of the rational group algebra of the same group. This result is used to compute idempotent generators of minimal abelian codes, extending results of Arora and Pruthi [S.K. Arora, M. Pruthi, Minimal cyclic codes of length 2p^n, Finite Field Appl. 5 (1999) 177-187; M. Pruthi, S.K. Arora, Minimal codes of prime power length, Finite Field Appl. 3 (1997) 99-113]. We also show how to compute the dimension and weight of these codes in a simple way.