Related papers: Automorphism groups of cyclic codes
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…
A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…
Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
The trialitarian automorphisms considered in this paper are the outer automorphisms of order 3 of adjoint classical groups of type D_4 over arbitrary fields. A one-to-one correspondence is established between their conjugacy classes and…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…
The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…
We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.
In this paper, we construct countably many isolated circular orders on the free products $G = F_{2n} \ast \mathbb{Z}_{m_1} \ast \cdots \ast \mathbb{Z}_{m_k}$ of cyclic groups. Moreover, we prove that these isolated circular orders are not…
Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…
This paper determines the structure of the automorphism group of the unit group \((U_{p^e}, \cdot)\) and the monoid \((\mathbb{Z}/p^e \mathbb{Z}, \cdot)\). For \( e \geq 5 \), we establish that the automorphism group \( \Aut(U_{2^e}, \cdot)…
This paper contributes to construct double circulant self-dual codes by sextic cyclotomy. Generator matrixes of a family of pure double circulant codes and a family of double circulant codes with boundary are formed from sextic cyclotomic…
We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…
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…