|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 2, Pages 42–49
(Mi ppi94)
|
|
|
|
This article is cited in 14 scientific papers (total in 14 papers)
Coding Theory
On the Structure of Symmetry Groups
of Vasil'ev Codes
S. V. Avgustinovicha, F. I. Solov'evaa, O. Hedenb a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Royal Institute of Technology
Abstract:
The structure of symmetry groups of Vasil'ev codes is studied. It is proved that
the symmetry group of an arbitrary perfect binary non-full-rank Vasil'ev code of length $n$ is
always nontrivial; for codes of rank $n-\log(n+1)+1$, an attainable upper bound on the order
of the symmetry group is obtained.
Received: 22.09.2004
Citation:
S. V. Avgustinovich, F. I. Solov'eva, O. Heden, “On the Structure of Symmetry Groups
of Vasil'ev Codes”, Probl. Peredachi Inf., 41:2 (2005), 42–49; Problems Inform. Transmission, 41:2 (2005), 105–112
Linking options:
https://www.mathnet.ru/eng/ppi94 https://www.mathnet.ru/eng/ppi/v41/i2/p42
|
Statistics & downloads: |
Abstract page: | 447 | Full-text PDF : | 154 | References: | 37 | First page: | 2 |
|