2000 character limit reached
G-equivalence in group algebras and minimal abelian codes (1203.5742v1)
Published 26 Mar 2012 in cs.IT, math.GR, math.IT, and math.RA
Abstract: 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.