🔧На сайте запланированы технические работы
25.12.2025 в промежутке с 18:00 до 21:00 по Московскому времени (GMT+3) на сайте будут проводиться плановые технические работы. Возможны перебои с доступом к сайту. Приносим извинения за временные неудобства. Благодарим за понимание!
🔧Site maintenance is scheduled.
Scheduled maintenance will be performed on the site from 6:00 PM to 9:00 PM Moscow time (GMT+3) on December 25, 2025. Site access may be interrupted. We apologize for the inconvenience. Thank you for your understanding!

 

On Calculation of Monomial Automorphisms of Linear Cyclic Codes


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

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.

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

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2018