{"title":"On automorphism groups of binary cyclic codes","authors":"Jicheng Ma, Guiying Yan","doi":"10.1007/s10623-024-01539-y","DOIUrl":null,"url":null,"abstract":"<p>Cyclic codes, as a significant subclass of linear codes, can be constructed and analyzed using algebraic methods. Due to its cyclic nature, they have efficient encoding and decoding algorithms. To date, cyclic codes have found applications in various domains, including consumer electronics, data storage systems, and communication systems. In this paper, we investigate the full automorphism groups of binary cyclic codes. A matrix presentation technique of cyclic codewords is introduced, which subsequently serves well for presenting binary cyclic codes of long lengths. These constructions are significantly useful in facilitating the determination of the full automorphism groups of binary cyclic codes of specified lengths.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"8 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01539-y","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Cyclic codes, as a significant subclass of linear codes, can be constructed and analyzed using algebraic methods. Due to its cyclic nature, they have efficient encoding and decoding algorithms. To date, cyclic codes have found applications in various domains, including consumer electronics, data storage systems, and communication systems. In this paper, we investigate the full automorphism groups of binary cyclic codes. A matrix presentation technique of cyclic codewords is introduced, which subsequently serves well for presenting binary cyclic codes of long lengths. These constructions are significantly useful in facilitating the determination of the full automorphism groups of binary cyclic codes of specified lengths.
期刊介绍：
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
