Email this article On Calculation of Monomial Automorphisms of Linear Cyclic Codes
- Authors: Kugurakov V.S.1, Gainutdinova A.1, Anisimova T.1
-
Affiliations:
- Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
- Issue: Vol 39, No 7 (2018)
- Pages: 1024-1038
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202898
- DOI: https://doi.org/10.1134/S1995080218070168
- ID: 202898
Cite item
Open Access
Access granted
Subscription Access
Abstract
A description of the monomial automorphisms group of an arbitrary linear cyclic code in term of polynomials is presented. This allows us to reduce a task of code’s monomial automorphisms calculation to a task of solving some system of equations (in general, nonlinear) over a finite field. The results are illustrated with examples of calculating the full monomial automorphisms groups for two codes.
About the authors
V. S. Kugurakov
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Author for correspondence.
Email: vladimir.kugurakov@kpfu.ru
Russian Federation, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
A. Gainutdinova
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Email: vladimir.kugurakov@kpfu.ru
Russian Federation, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
T. Anisimova
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Email: vladimir.kugurakov@kpfu.ru
Russian Federation, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
