Показать сокращенную информацию
dc.contributor.author | Kugurakov V. | |
dc.contributor.author | Gainutdinova A. | |
dc.contributor.author | Anisimova T. | |
dc.date.accessioned | 2019-01-22T20:51:53Z | |
dc.date.available | 2019-01-22T20:51:53Z | |
dc.date.issued | 2018 | |
dc.identifier.issn | 1995-0802 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/149157 | |
dc.description.abstract | © 2018, Pleiades Publishing, Ltd. 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. | |
dc.relation.ispartofseries | Lobachevskii Journal of Mathematics | |
dc.subject | Linear cyclic codes | |
dc.subject | monomial automorphisms of codes | |
dc.title | On Calculation of Monomial Automorphisms of Linear Cyclic Codes | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 7 | |
dc.relation.ispartofseries-volume | 39 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 1024 | |
dc.source.id | SCOPUS19950802-2018-39-7-SID85053553852 |