English

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

Group Theory 2022-01-05 v3 Information Theory math.IT

Abstract

Let GG be a finite abelian group. Ferraz, Guerreiro and Polcino Milies prove that the number of GG-equivalence classes of minimal abelian codes is equal to the number of GG-isomorphism classes of subgroups for which corresponding quotients are cyclic. In this article, we prove that the notion of GG-isomorphism is equivalent to the notion of isomorphism on the set of all subgroups HH of GG with the property that G/HG/H is cyclic. As an application, we calculate the number of non-GG-equivalent minimal abelian codes for some specific family of abelian groups. We also prove that the number of non-GG-equivalent minimal abelian codes is equal to number of divisors of the exponent of GG if and only if for each prime pp dividing the order of GG, the Sylow pp-subgroups of GG are homocyclic.

Keywords

Cite

@article{arxiv.1904.04077,
  title  = {On the number of non-G-equivalent minimal abelian codes},
  author = {Fatma Altunbulak Aksu and İpek Tuvay},
  journal= {arXiv preprint arXiv:1904.04077},
  year   = {2022}
}

Comments

8 pages