Search arXivSearch

arXiv · 2201.06366

A characterization of abelian group codes in terms of their parameters

Abstract

In 1979, Miller proved that for a group $G$ of odd order, two minimal group codes in $\mathbb{F}_2G$ are $G$-equivalent if and only they have identical weight distribution. In 2014, Ferraz-Guerreiro-Polcino Milies disprove Miller's result by giving an example of two non-$G$-equivalent minimal codes with identical weight distribution. In this paper, we give a characterization of finite abelian groups so that over a specific set of group codes, equality of important parameters of two codes implies the $G$-equivalence of these two codes. As a corollary, we prove that two minimal codes with the same weight distribution are $G$-equivalent if and only if for each prime divisor $p$ of $|G|$, the Sylow $p$-subgroup of $G$ is homocyclic.

Explore related subjects

Keep this discovery

BibTeXRIS

Fatma Altunbulak Aksu, İpek Tuvay. 2022-01-17. A characterization of abelian group codes in terms of their parameters. https://doi.org/10.55730/1300-0098.3296

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR