English
Related papers

Related papers: On the automorphism groups of binary linear codes

200 papers

For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…

Group Theory · Mathematics 2016-01-19 Carles Broto , Jesper M. Møller , Bob Oliver

We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…

Group Theory · Mathematics 2024-06-13 Diego García-Lucas , Ángel del Río

Results of the computation of the automorphism groups for the groups of orders $16p$ and $16p^{2}$ are given. In some cases it has not been possible to give as complete a set of results as was done previously for the case of groups of order…

Group Theory · Mathematics 2007-11-16 Elaine W. Becker , Walter Becker

A finite group $G$ is called a DCI-group if two Cayley digraphs over $G$ are isomorphic if and only if their connection sets are conjugate by a group automorphism. We prove that the group $C_2^5\times C_p$, where $p$ is a prime, is a…

Combinatorics · Mathematics 2020-12-29 Grigory Ryabov

The Gruenberg-Kegel graph ${\rm GK}(G)=(V_G, E_G)$ of a finite group $G$ is a simple graph with vertex set $V_G=\pi(G)$, the set of all primes dividing the order of $G$, and such that two distinct vertices $p$ and $q$ are joined by an edge,…

Group Theory · Mathematics 2015-12-04 A. R. Moghaddamfar , S. Rahbariyan

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,…

Information Theory · Computer Science 2018-07-25 Serhii Dyshko

Let $G$ be the group of unimodular automorphisms of $\mathbb C^2$. In the paper we prove two interesting results about this group. The first one is about absence of non-trivial finite-dimensional representations of $G$. The second one, we…

Group Theory · Mathematics 2014-02-06 Alimjon Eshmatov , Farkhod Eshmatov

Let $p$ be an odd prime and let $\mathbf{B}$ be a $p$-block of a finite group, such that $\mathbf{B}$ has cyclic defect groups. We describe the self-dual indecomposable $\mathbf{B}$-modules and for each such module determine whether it is…

Representation Theory · Mathematics 2024-12-18 Caroline Lassueur , John Murray

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…

Information Theory · Computer Science 2026-05-27 Harshvardhan Pandey , Prasad Krishnan

The groups of order 64p without a normal sylow p-subgroup are listed, and their automorphism groups are also determined. As a by-product of our original effort to get these groups, we needed to determine the automorphism groups of those…

Group Theory · Mathematics 2013-10-02 Walter Becker , Elaine W. Becker

Let $p$ be a an odd prime and let $G$ be a finite $p$-group with cyclic commutator subgroup $G'$. We prove that the exponent and the abelianization of the centralizer of $G'$ in $G$ are determined by the group algebra of $G$ over any field…

Group Theory · Mathematics 2022-09-23 Diego García-Lucas , Ángel del Río , Mima Stanojkovski

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…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

Information Theory · Computer Science 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez

Let $C$ be an extremal self-dual binary code of length 72 and $g\in \Aut(C) $ be an automorphism of order 2. We show that $C$ is a free $\F_2<g>$ module and use this to exclude certain subgroups of order 8 of $\Aut (C)$. We also show that…

Information Theory · Computer Science 2011-12-01 Gabriele Nebe

In this paper, we determine the automorphism group of the $p$-cones ($p\neq 2$) in dimension greater than two. In particular, we show that the automorphism group of those $p$-cones are the positive scalar multiples of the generalized…

Optimization and Control · Mathematics 2021-09-27 Masaru Ito , Bruno F. Lourenço

Using the method for constructing binary self-dual codes with an automorphism of order square of a prime number we have classified all binary self-dual codes with length 76 having minimum distance $d=14$ and automorphism of order 9. Up to…

Combinatorics · Mathematics 2018-06-15 Nikolay Yankov , Radka Russeva , Emine Karatash

The results of computer computations determining the automorphism groups of the groups of order 32$p$ for $p \geq 3$ are given in several tables. Presentations for the automorphism groups of the groups of order 32, which in many cases…

Group Theory · Mathematics 2009-11-20 Elaine W. Becker , Walter Becker

Let $\mathcal{L}$ be a centric linking system associated to a saturated fusion system on a finite $p$-group $S$. An automorphism of $\mathcal{L}$ is said to be rigid if it restricts to the identity on the fusion system. An inner rigid…

Group Theory · Mathematics 2026-04-23 Jonathon Villareal

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

Group Theory · Mathematics 2024-02-21 Mark L. Lewis , Quanfu Yan

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

Combinatorics · Mathematics 2021-03-24 William M. Kantor