On Calculation of Monomial Automorphisms of Linear Cyclic Codes


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##