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

Probl. Peredachi Inf., 2000 Volume 36, Issue 4, Pages 53–58 (Mi ppi494)

This article is cited in 16 papers

Coding Theory

On Automorphism Groups of Perfect Binary Codes and Steiner Triple Systems

F. I. Solov'eva, S. T. Topalova


Abstract: We prove that the order of the automorphism group of an arbitrary perfect binary code with $d=3$ is not greater than that of the automorphism group of the Hamming code of the same length. We also obtain an upper estimate for the order of the automorphism group of an arbitrary Steiner system $S(t,t+1,n)$.

UDC: 621.391.15

Received: 21.02.2000
Revised: 26.07.2000


 English version:
Problems of Information Transmission, 2000, 36:4, 331–335

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024