Computer Science – Information Theory
Scientific paper
2012-03-26
Computer Science
Information Theory
8 pages, 4 tables
Scientific paper
Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an automorphism of G whose linear extension to FG maps I onto J In this paper we give a necessary and sufficient condition for minimal abelian codes to be G-equivalent and show how to correct some results in the literature.
Ferraz Raul Antonio
Guerreiro Marinês
Milies César Polcino
No associations
LandOfFree
G-equivalence in group algebras and minimal abelian codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with G-equivalence in group algebras and minimal abelian codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and G-equivalence in group algebras and minimal abelian codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-642613