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 (231.4 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

The polycyclic codes over the finite field Fq

School of Mathematics and Statistics, Shandong University of Technology, Zibo, Shandong 255049, China
Show Author Information

Abstract

This article extended the properties of the idempotent generator of cyclic codes to polycyclic codes over the finite field Fq. In addition, the check matrix of polycyclic codes was provided over Fq. Specifically, it has been proven that the constacyclic code is an MDS code over Fq if and only if its annihilator dual code is also an MDS code. Finally, we have provided some examples of good codes.

CLC number: 94B15, 94B05

References

【1】
【1】
 
 
AIMS Mathematics
Pages 29707-29717

{{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:
Qi W. The polycyclic codes over the finite field Fq. AIMS Mathematics, 2024, 9(11): 29707-29717. https://doi.org/10.3934/math.20241439

904

Views

58

Downloads

1

Crossref

0

Web of Science

1

Scopus

Received: 30 August 2024
Revised: 04 October 2024
Accepted: 14 October 2024
Published: 21 October 2024
©2024 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)