距离最小的最优常环码四

IF 0.6 4区工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-02-27 DOI:10.1007/s00200-024-00648-4

Yajing Zhou, Xiaoshan Kai, Zhonghua Sun

{"title":"距离最小的最优常环码四","authors":"Yajing Zhou, Xiaoshan Kai, Zhonghua Sun","doi":"10.1007/s00200-024-00648-4","DOIUrl":null,"url":null,"abstract":"Let \\(n=2(p^m-1)/(p-1)\\), where p is an odd prime and \\(m>1\\) is a positive integer. In this paper, we research optimal p-ary constacyclic codes with two zeros. Two classes of optimal p-ary \\([n,n-2m,4]\\) constacyclic codes are presented by searching the solutions of certain congruence equations over \\(\\mathbb {F}_{p^m}\\). Four explicit constructions of optimal constacyclic codes with such parameters are provided. The dual codes of a subclass of these constacyclic codes are also investigated.","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal constacyclic codes with minimum distance four\",\"authors\":\"Yajing Zhou, Xiaoshan Kai, Zhonghua Sun\",\"doi\":\"10.1007/s00200-024-00648-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let \\\\(n=2(p^m-1)/(p-1)\\\\), where p is an odd prime and \\\\(m>1\\\\) is a positive integer. In this paper, we research optimal p-ary constacyclic codes with two zeros. Two classes of optimal p-ary \\\\([n,n-2m,4]\\\\) constacyclic codes are presented by searching the solutions of certain congruence equations over \\\\(\\\\mathbb {F}_{p^m}\\\\). Four explicit constructions of optimal constacyclic codes with such parameters are provided. The dual codes of a subclass of these constacyclic codes are also investigated.\",\"PeriodicalId\":50742,\"journal\":{\"name\":\"Applicable Algebra in Engineering Communication and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Algebra in Engineering Communication and Computing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1007/s00200-024-00648-4\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s00200-024-00648-4","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

让（n=2(p^m-1)/(p-1)\），其中 p 是奇素数，\(m>1\)是正整数。本文研究了具有两个零的最优 pary 常环码。通过搜索 \(\mathbb {F}_{p^m}\) 上某些全等方程的解，提出了两类最优 pary \([n,n-2m,4]\)constacyclic码。本文提供了四种具有此类参数的最优constacyclic编码的明确构造。此外，还研究了这些常环码的一个子类的对偶码。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal constacyclic codes with minimum distance four

Let \(n=2(p^m-1)/(p-1)\), where p is an odd prime and \(m>1\) is a positive integer. In this paper, we research optimal p-ary constacyclic codes with two zeros. Two classes of optimal p-ary \([n,n-2m,4]\) constacyclic codes are presented by searching the solutions of certain congruence equations over \(\mathbb {F}_{p^m}\). Four explicit constructions of optimal constacyclic codes with such parameters are provided. The dual codes of a subclass of these constacyclic codes are also investigated.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Applicable Algebra in Engineering Communication and Computing 工程技术-计算机：跨学科应用

CiteScore

2.90

自引率

14.30%

发文量

审稿时长

>12 weeks

期刊介绍： Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.