Related papers: Automorphism groups of cyclic codes
The automorphism groups of various linear codes are extensively studied yielding insights into the respective code structure. This knowledge is used in, e.g., theoretical analysis and in improving decoding performance, motivating the…
In this paper we obtain the Wedderburn-Artin decomposition of a semisimple group algebra associated to a direct product of finite groups. We also provide formulae for the number of all possible group codes, and their dimensions, that can be…
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…
This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…
We study the automorphism groups of finite-dimensional cyclic Leibniz algebras. In this connection, we consider the relationships between groups, modules over associative rings and Leibniz algebras.
In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored graphs is itself the automorphism groups of an edge-colored…
We determine the structure of automorphism group or each nonsplit metacyclic 2-group. This completes the work on automorphism groups of metacyclic $p$-groups.
Automorphism groups are intrincate conjugacy invariants for subshifts, which can reveal important features of the dynamical structure of a shift action. One important case is the study of automorphism groups when the underlying subshift has…
Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…
We introduce two refinements of the class of $5/2$-groups, inspired by the classes of automorphism groups of configurations and automorphism groups of unit circulant digraphs. We show that both of these classes have the property that any…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
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.
The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is…
The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of…
A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be…
We give a parametrization of cyclic pointed categories associated to the cyclic group of order $n$ in terms of $n$-th roots of unity. We also provide a diagramatic description of these categories by generators and relations, and use it to…