RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2005 Volume 41, Issue 2, Pages 42–49 (Mi ppi94)

This article is cited 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.

UDC: 621.391.15

Received: 22.09.2004


 English version:
Problems of Information Transmission, 2005, 41:2, 105–112

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025