Hulls of <inline-formula><tex-math id="M1">$\mathbb Z_p\mathbb Z_p[v] $</tex-math></inline-formula>-cyclic codes and construction of EAQECCs

In this paper, we study the hulls of $ \mathbb{Z}_p\mathbb{Z}_p[v] $- cyclic codes for any prime $ p $, where $ v^2 = v $. Firstly, we derive the generator polynomials of the hulls of separable cyclic codes (SCCs) over $ \mathbb{Z}_p\mathbb{Z}_p[v] $ and determine their dimensions using the concept of a generating function in combinatorics. We also enumerate the SCCs over $ \mathbb{Z}_p\mathbb{Z}_p[v] $ with hulls of a fixed dimension. Next, we present the generator polynomials of the hulls of non-separable cyclic codes (NSCCs) over $ \mathbb{Z}_2\mathbb{Z}_2[v] $ with coprime odd block lengths and determine their dimensions. Additionally, we enumerate the NSCCs over $ \mathbb{Z}_2\mathbb{Z}_2[v] $ with hulls of a fixed dimension. As an application, we use the hulls of NSCCs over $ \mathbb{Z}_2\mathbb{Z}_2[v] $ to construct some good entanglement-assisted quantum error-correcting codes (EAQECCs).

Authors

Institutions

Publication Details

Journal
Advances in Mathematics of Communications
Published
2025-08-11
DOI
https://doi.org/10.3934/amc.2025037
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

Hulls of <inline-formula><tex-math id="M1">$\mathbb Z_p\mathbb Z_p[v] $</tex-math></inline-formula>-cyclic codes and construction of EAQECCs

Ashish Kumar Upadhyay, Awadhesh Kumar Shukla, Sachin Pathak, Vipul Mishra et al.
Advances in Mathematics of Communications
Coding theory and cryptography
article

Hulls of <inline-formula><tex-math id="M1">$\mathbb Z_p\mathbb Z_p[v] $</tex-math></inline-formula>-cyclic codes and construction of EAQECCs

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

Abstract

In this paper, we study the hulls of $ \mathbb{Z}_p\mathbb{Z}_p[v] $- cyclic codes for any prime $ p $, where $ v^2 = v $. Firstly, we derive the generator polynomials of the hulls of separable cyclic codes (SCCs) over $ \mathbb{Z}_p\mathbb{Z}_p[v] $ and determine their dimensions using the concept of a generating function in combinatorics. We also enumerate the SCCs over $ \mathbb{Z}_p\mathbb{Z}_p[v] $ with hulls of a fixed dimension. Next, we present the generator polynomials of the hulls of non-separable cyclic codes (NSCCs) over $ \mathbb{Z}_2\mathbb{Z}_2[v] $ with coprime odd block lengths and determine their dimensions. Additionally, we enumerate the NSCCs over $ \mathbb{Z}_2\mathbb{Z}_2[v] $ with hulls of a fixed dimension. As an application, we use the hulls of NSCCs over $ \mathbb{Z}_2\mathbb{Z}_2[v] $ to construct some good entanglement-assisted quantum error-correcting codes (EAQECCs).

Advances in Mathematics of CommunicationsVol. 20(0)
University of Allahabad (IN), Banaras Hindu University (IN)
Openalex Percentile: Top 89%
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.