AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (295.5 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Repeated-root constacyclic codes of length p 1 p 2 t p s and their dual codes

Hongfeng Wu1Li Zhu2( )
College of Science, North China University of technology, Beijing 100144, China
School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
Show Author Information

Abstract

Let F q be the finite field with q = p k elements, and p 1 , p 2 be two distinct prime numbers different from p. In this paper, we first calculate all the q-cyclotomic cosets modulo p 1 p 2 t as a preparation for the following parts. Then we give the explicit generator polynomials of all the constacyclic codes of length p 1 p 2 t p s over F q and their dual codes. In the rest of this paper, we determine all self-dual cyclic codes of length p 1 p 2 t p s and their enumeration. This answers a question recently asked by B. Chen, H.Q.Dinh and Liu. In the last section, we calculate the case of length 5 p s as an example.

CLC number: 11T71, 12Y05, 94B15

References

【1】
【1】
 
 
AIMS Mathematics
Pages 12793-12818

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Wu H, Zhu L. Repeated-root constacyclic codes of length p 1 p 2 t p s and their dual codes. AIMS Mathematics, 2023, 8(6): 12793-12818. https://doi.org/10.3934/math.2023644

377

Views

1

Downloads

3

Crossref

3

Web of Science

3

Scopus

Received: 18 September 2022
Revised: 25 October 2022
Accepted: 01 November 2022
Published: 15 June 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)