Related papers: Automorphism groups of cyclic codes

Every semidirect product of groups $K\rtimes H$ has size $\left | K \right | \cdot \left | H\right |$, yet the size of such a group's automorphism group varies with the chosen action of $H$ on $K$. This paper will explore groups of the form…

For any code loop $L$, we prove that the half-automorphism group of $L$ is the product of the automorphism group of $L$ by an elementary abelian $2-$group consisting of all half-automorphisms that acts as the identity on a fixed basis.…

We survey recent results on multiple transitivity of automorphism groups of affine algebraic varieties. We consider the property of infinite transitivity of the special automorphism group, which is equivalent to flexibility of the…

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

We study automorphism groups of randomizations of separable structures, with focus on the $\aleph_0$-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original…

A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…

We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…

Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with…

We show that the wreath product of two finite symmetric or alternating groups is 2-generated.

In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…

We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.

It is known that an automorphism group of a K3 surface with Picard number two is either infinite cyclic group or infinite dihedral group if it is infinite. In this paper, we study the generators of an automorphism group. We use the…

Using a unified method, we determine the structure of automorphisms and representations of arbitrary polyadic groups. More precisely, for a polyadic group $(G, f)=der_{\theta, b}(G, \cdot)$, we obtain a complete description of automorphisms…

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…

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

We introduce the free inhomogeneous wreath product of compact matrix quantum groups, which generalizes the free wreath product (Bichon 2004). We use this to present a general technique to determine quantum automorphism groups of connected…

We study $C_{a, b}$ curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how $C_{a, b}$ curves can be used to construct MDS codes and…

Automorphism groups of $2$-groups of coclass at most $3$ are investigated.

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…