On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group

IF 0.5 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
I. Yu. Mogilnykh
{"title":"On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group","authors":"I. Yu. Mogilnykh","doi":"10.1134/s0032946022010045","DOIUrl":null,"url":null,"abstract":"<p>A code is said to be propelinear if its automorphism group contains a subgroup acting on its codewords regularly. A subgroup of the group <span>\\(GA(r,q)\\)</span> of affine transformations is said to be regular if it acts regularly on vectors of <span>\\(\\mathbb{F}_q^r\\)</span>. Every automorphism of a regular subgroup of the general affine group <span>\\(GA(r,q)\\)</span> induces a permutation on the cosets of the Hamming code of length <span>\\(\\frac{q^r-1}{q-1}\\)</span>. Based on this permutation, we propose a construction of <span>\\(q\\)</span>⁠-⁠ary propelinear perfect codes of length <span>\\(\\frac{q^{r+1}-1}{q-1}\\)</span>. In particular, for any prime <span>\\(q\\)</span> we obtain an infinite series of almost full rank <span>\\(q\\)</span>⁠-⁠ary propelinear perfect codes.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"8 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Transmission","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0032946022010045","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

A code is said to be propelinear if its automorphism group contains a subgroup acting on its codewords regularly. A subgroup of the group \(GA(r,q)\) of affine transformations is said to be regular if it acts regularly on vectors of \(\mathbb{F}_q^r\). Every automorphism of a regular subgroup of the general affine group \(GA(r,q)\) induces a permutation on the cosets of the Hamming code of length \(\frac{q^r-1}{q-1}\). Based on this permutation, we propose a construction of \(q\)⁠-⁠ary propelinear perfect codes of length \(\frac{q^{r+1}-1}{q-1}\). In particular, for any prime \(q\) we obtain an infinite series of almost full rank \(q\)⁠-⁠ary propelinear perfect codes.

基于一般仿射群正则子群的q元线性完美码
如果一个码的自同构群包含一个有规律地作用于码字的子群,那么这个码就是线性的。如果仿射变换的群\(GA(r,q)\)的子群有规律地作用于\(\mathbb{F}_q^r\)的向量,则称它是正则的。一般仿射群\(GA(r,q)\)的正则子群的每一个自同构都在长度为\(\frac{q^r-1}{q-1}\)的汉明码的集上引起一个置换。在此基础上,我们提出了一个长度为\(\frac{q^{r+1}-1}{q-1}\)的\(q\) - - - - -任意的线性完美码的构造。特别地,对于任意素数\(q\),我们得到了一个几乎满秩的无穷级数\(q\) -任意线性完美码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Problems of Information Transmission
Problems of Information Transmission 工程技术-计算机:理论方法
CiteScore
2.00
自引率
25.00%
发文量
10
审稿时长
>12 weeks
期刊介绍: Problems of Information Transmission is of interest to researcher in all fields concerned with the research and development of communication systems. This quarterly journal features coverage of statistical information theory; coding theory and techniques; noisy channels; error detection and correction; signal detection, extraction, and analysis; analysis of communication networks; optimal processing and routing; the theory of random processes; and bionics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信