Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 4 Apr 2019 in math.GR, cs.IT, and math.IT | (1904.04077v3)

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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.