Repeated-root constacyclic codes of length 3ps over the finite non-chain ring 𝔽pm[u,v] 〈u2,v2,uv−vu〉 and their duals
This study aims to determine the algebraic structures of [Formula: see text]-constacyclic codes of length [Formula: see text] over the finite commutative non-chain ring [Formula: see text], for a prime [Formula: see text] For the unit [Formula: see text], we consider two different instances: when [Formula: see text] is a cube in [Formula: see text] and when it is not. Analyzing the first scenario is relatively easy. When [Formula: see text] is not a unit in [Formula: see text], we consider several subcases and determine the algebraic structures of constacyclic codes in those cases. Further, we also provide the number of codewords and the duals of [Formula: see text]-constacyclic codes.
Authors
- Prasanna Poojary (ORCID: https://orcid.org/0000-0002-0749-8994)
- G. R. Vadiraja Bhatta (ORCID: https://orcid.org/0000-0003-0631-0205)
- D. Acharya
Institutions
- Manipal Academy of Higher Education (IN)
Publication Details
- Journal
- Discrete Mathematics Algorithms and Applications
- Published
- 2025-03-26
- DOI
- https://doi.org/10.1142/s179383092550065x
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00