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