Related papers: On the Automorphism Groups and Equivalence of Cycl…

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

A lot of attention has been paid to the investigation of the algebraic properties of linear codes. In most cases, this investigation involves the determination of required code automorphisms, which are useful for decoders, such as the…

We show that the holomorph of a cyclic group of order $n$ is isomorphic to its own automophism group when $n$ is twice of a power of an odd prime.

We determine the structure of automorphism group or each nonsplit metacyclic 2-group. This completes the work on automorphism groups of metacyclic $p$-groups.

In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.

When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

We give an explicit description of the automorphism group of a product of complete toric varieties over an arbitrary field in terms of the respective automorphism groups of its components. More precisely, we prove that, up to permutation of…

The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at…

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…