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

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…