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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On a class of constacyclic codes and MDS code construction over 𝔽pm[u,v] 〈u2−δu,v2−γv,uv−vu〉

A. Upadhyay, Awadhesh Kumar Shukla, Sachin Pathak, Om Prakash Pandey et al.
Asian-European Journal of Mathematics
Coding theory and cryptography
article

On a class of constacyclic codes and MDS code construction over 𝔽pm[u,v] 〈u2−δu,v2−γv,uv−vu〉

A. Upadhyay, Awadhesh Kumar Shukla, Sachin Pathak, Om Prakash Pandey, Vipul Mishra
article en

Abstract

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.

Asian-European Journal of MathematicsVol. 18(02)
NIIT (India) (IN), Banaras Hindu University (IN)
Openalex Percentile: Top 86%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On a class of constacyclic codes and MDS code construction over 𝔽pm[u,v] 〈u2−δu,v2−γv,uv−vu〉 — A. Upadhyay, Awadhesh Kumar Shukla, et al. · Asian-European Journal of Mathematics (2024) | TGRS Research Map | TGRS