A Special Class of Repeated-Root Constacyclic Codes
Let \(\mathbb{F}\)q be a finite field with q elements where q be a prime power. Among the classes of constacyclic codes of length 5ℓps over \(\mathbb{F}\)q we define an equivalence relation such that the classes of constacyclic codes which have the same structure are viewed to be equivalent. In this paper we classify the classes of constacyclic codes of length 5ℓ and give the explicit generator polynomials of all the constacyclic codes and their dual codes.
Authors
- Ke Wang (ORCID: https://orcid.org/0000-0001-5110-6591)
Institutions
- North China University of Technology (CN)
Publication Details
- Journal
- Asian journal of mathematics and computer research
- Published
- 2025-04-05
- DOI
- https://doi.org/10.56557/ajomcor/2025/v32i39228
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00