On the number of non-G-equivalent minimal abelian codes

04/04/2019

∙

by   Fatma Altunbulak Aksu, et al.

∙

0

∙

share

Let G be a finite abelian group. We prove that the number of non-G-equivalent minimal abelian codes is equal to number of divisors of the exponent of G if and only if for each prime p dividing the order of G, the Sylow p-subgroups of G are homocyclic.