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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Phelps, K.T., Every Finite Group is the Automorphism Group of Some Perfect Code, J. Combin. Theory, Ser. A, 1986, vol. 43, no.1, pp. 45–51.
Avgustinovich, S.V. and Solov’eva, F.I., Perfect Binary Codes with Trivial Automorphism Group, in Proc. Int. Workshop on Inf. Theory, Killarney, Ireland, 1998, pp. 114–115.
Malyugin, S.A., Perfect Codes with Trivial Automorphism Group, Proc. 2nd Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 1998, Sofia, 1998, pp. 163–167.
Solov’eva, F.I. and Topalova, S.T., On Automorphism Groups of Perfect Binary Codes and Steiner Triple Systems, Probl. Peredachi Inf., 2000, vol. 36, no.4, pp. 53–58 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 4, pp. 331–335].
Solov’eva, F.I. and Topalova, S.T., Perfect Binary Codes and Steiner Triple Systems with Maximal Orders of Automorphism Groups, Diskretn. Anal. Issled. Oper., Ser. 1, 2000, vol. 7, no.4, pp. 101–110.
Malyugin, S.A., On the Order of Automorphism Group of Perfect Binary Codes, Diskretn. Anal. Issled. Oper., Ser. 1, 2000, vol. 7, no.4, pp. 91–100.
Phelps, K.T. and Rifa, J., On Binary 1-Perfect Additive Codes: Some Structural Properties, IEEE Trans. Inform. Theory, 2002, vol. 48, no.9, pp. 2587–2592.
Malyugin, S.A., Transitive Perfect Codes of Length 15, in Proc. Int. Workshop on Discrete Analysis and Operation Research, Novosibirsk, Russia, 2004, p. 96.
Solov’eva, F.I., On Transitive Codes, in Proc. Int. Workshop on Discrete Analysis and Operation Research, Novosibirsk, Russia, 2004, p. 99.
Avgustinovich, S.V., Heden, O., and Solov’eva, F.I., On Group of Symmetries of Vasil’ev Codes, in Proc. 9th Int. Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, 2004, pp. 27–33.
Vasil’ev, Yu.L., On Nongroup Closely Packed Codes, Probl. Kibern., 1962, vol. 8, pp. 337–339.
Avgustinovich, S.V., Solov’eva, F.I., and Heden, O., On the Ranks and Kernels Problem for Perfect Codes, Probl. Peredachi Inf., 2003, vol. 39, no.4, pp. 30–34 [Probl. Inf. Trans. (Engl. Transl.), 2003, vol. 39, no. 4, pp. 341–345].
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.
Avgustinovich, S.V., Solov’eva, F.I., and Heden, O., Full Rank Perfect Codes with Big Kernels, Diskr. Analiz Issled. Operatsii, Ser. 1, 2001, vol. 8, no.4, pp. 3–8.
Avgustinovich, S.V., Heden, O., and Solov’eva, F.I., The Classification of Some Perfect Codes, Des. Codes Cryptogr., 2004, vol. 31, no.3, pp. 313–318.
Etzion, T. and Vardy, A., On Perfect Codes and Tilings: Problems and Solutions, SIAM J. Discrete Math., 1998, vol. 11, no.2, pp. 205–223.
Author information
Authors and Affiliations
Additional information
__________
Translated from Problemy Peredachi Informatsii, No. 2, 2005, pp. 42–49.
Original Russian Text Copyright © 2005 by Avgustinovich, Solov’eva, Heden.
Supported in part by the Royal Swedish Academy of Sciences.
Rights and permissions
About this article
Cite this article
Avgustinovich, S.V., Solov’eva, F.I. & Heden, O. On the Structure of Symmetry Groups of Vasil’ev Codes. Probl Inf Transm 41, 105–112 (2005). https://doi.org/10.1007/s11122-005-0015-5
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11122-005-0015-5