On a class of constacyclic codes and MDS code construction over 𝔽pm[u,v] 〈u2−δu,v2−γv,uv−vu〉
Let [Formula: see text] denote a finite field, where [Formula: see text] is a prime and [Formula: see text] is a positive integer. In this paper, we study idempotent decomposition of the finite, commutative, non-local ring, [Formula: see text], where [Formula: see text]. This paper consists of the structure of [Formula: see text]-constacyclic (CC) codes over [Formula: see text], where [Formula: see text]. The structure of dual of CC codes is used to determine the Euclidean hull of such codes. Then, the Hamming distance and symbol-pair distance for the [Formula: see text]-CC codes of length [Formula: see text] over [Formula: see text] is determined. Additionally, conditions for repeated root [Formula: see text]-CC code to be maximal distance separable (MDS) in terms of Hamming distance and symbol-pair distance are provided. Finally, we present examples of several linear and symbol-pair codes some of which are MDS with respect to Hamming and symbol-pair distance.
Authors
- A. Upadhyay (ORCID: https://orcid.org/0000-0001-6307-6799)
- Awadhesh Kumar Shukla (ORCID: https://orcid.org/0000-0002-5974-1300)
- Sachin Pathak (ORCID: https://orcid.org/0000-0003-1435-6721)
- Om Prakash Pandey (ORCID: https://orcid.org/0000-0003-2788-3352)
- Vipul Mishra
Institutions
- NIIT (India) (IN)
- Banaras Hindu University (IN)
Publication Details
- Journal
- Asian-European Journal of Mathematics
- Published
- 2024-09-20
- DOI
- https://doi.org/10.1142/s1793557124501006
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00