|
Problemy Peredachi Informatsii, 2009, Volume 45, Issue 4, Pages 18–25
(Mi ppi1996)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
The group of permutational automorphisms of a $q$-ary Hamming code
E. V. Gorkunov Novosibirsk State University
Abstract:
We prove that the group of permutation automorphism of a $q$-ary Hamming code of length $n=(q^m-1)/(q-1)$ is isomorphic to the unitriangular group $\mathbf{UT}_m(q)$ if the code has a parity-check matrix composed of all columns of the form $(0\dots0\,1*\dots*)^\mathsf T$. We also show that the group of permutation automorphisms of a cyclic Hamming code cannot be isomorphic to $\mathbf{UT}_m(q)$. We thus show that equivalent codes can have different permutation automorphism groups.
Received: 30.05.2008 Revised: 15.10.2009
Citation:
E. V. Gorkunov, “The group of permutational automorphisms of a $q$-ary Hamming code”, Probl. Peredachi Inf., 45:4 (2009), 18–25; Problems Inform. Transmission, 45:4 (2009), 309–316
Linking options:
https://www.mathnet.ru/eng/ppi1996 https://www.mathnet.ru/eng/ppi/v45/i4/p18
|
Statistics & downloads: |
Abstract page: | 365 | Full-text PDF : | 104 | References: | 53 | First page: | 18 |
|