On Calculation of Monomial Automorphisms of Linear Cyclic Codes
- 作者: Kugurakov V.1, Gainutdinova A.1, Anisimova T.1
-
隶属关系:
- Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
- 期: 卷 39, 编号 7 (2018)
- 页面: 1024-1038
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202898
- DOI: https://doi.org/10.1134/S1995080218070168
- ID: 202898
如何引用文章
详细
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.
作者简介
V. Kugurakov
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
编辑信件的主要联系方式.
Email: vladimir.kugurakov@kpfu.ru
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
A. Gainutdinova
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Email: vladimir.kugurakov@kpfu.ru
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
T. Anisimova
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Email: vladimir.kugurakov@kpfu.ru
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
![](/img/style/loading.gif)