On Calculation of Monomial Automorphisms of Linear Cyclic Codes
- Autores: Kugurakov V.1, Gainutdinova A.1, Anisimova T.1
-
Afiliações:
- Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
- Edição: Volume 39, Nº 7 (2018)
- Páginas: 1024-1038
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202898
- DOI: https://doi.org/10.1134/S1995080218070168
- ID: 202898
Citar
Resumo
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.
Palavras-chave
Sobre autores
V. Kugurakov
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Autor responsável pela correspondência
Email: vladimir.kugurakov@kpfu.ru
Rússia, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
A. Gainutdinova
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Email: vladimir.kugurakov@kpfu.ru
Rússia, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
T. Anisimova
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Email: vladimir.kugurakov@kpfu.ru
Rússia, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008