Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Advances in Mathematics of Communications

Hulls of $\mathbb Z_p\mathbb Z_p[v] $ -cyclic codes and construction of EAQECCs

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

Published Aug 11, 2025• 1 citation
Publisher

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).

DOI
10.3934/amc.2025037

Related papers

MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction

Meng Cao

Let$q=p^{e}$be a prime power and$\ell $be an integer with$0\leq \ell \leq e-1$. The$\ell $-Galois hull of classical linear codes is a generalization of the Euclidean hull and Hermitian hull. We provide a necessary and sufficient condition under which a codeword of a GRS code or an extended GRS code belongs to its$\ell $-Galois dual code, generalizing both the Euclidean case and Hermitian case in the literature. By using four different tools: 1) the norm mapping from$\mathbb {F}_{q}^{\ast }$to$\mathbb {F}_{p^{\ell }}^{\ast }$; 2) the direct product of two cyclic subgroups; 3) the coset decomposition of a cyclic group; 4) an additive subgroup of$\mathbb {F}_{q}$and its cosets, we construct eleven families of$q$-ary MDS codes with$\ell $-Galois hulls of arbitrary dimensions, and give the related eleven families of$[[n,k,d;c]]_{q}$entanglement-assisted quantum error-correcting codes (EAQECCs) with relatively large minimum distance in the sense that$2d=n-k+2+c$. We show that developing the theory on$\ell $-Galois hulls of$q$-ary MDS codes in this paper enables us to obtain new$q$-ary EAQECCs with different kinds of length sets via different$\ell $, where$2\ell \mid e$.

IEEE Transactions on Information Theory•Oct 6, 2021•49 citations

Hulls of Non-Separable Constacyclic Codes over FqR and Their Applications in Constructing New QECCs

Xiying Zheng, Bo Hyun Kong, Enbin Zhang

Let R=Fq[u1,u2,u3]/⟨ui2=ui,uiuj=ujui=0⟩ and FqR={(a,d)|a∈Fq,d∈R}, where q=pm, p is a prime, and m∈N+. We investigate the algebraic structure of the non-separable constacyclic codes over the mixed-alphabet ring FqR and then determine the generator polynomials and the dimensions of their hulls. As an application, using the construction X, we obtain some new quantum error-correcting codes that are not listed in the online quantum codes database.

Entropy•Sep 17, 2026•0 citations

A Study of FqR-Cyclic Codes and Their Applications in Constructing Quantum Codes

Hai Quang Dinh, Sachin Pathak, Tushar Bag +2 more

Let R = Fq+ uFq+ vFq+ uvFq, with u2= u, v2= v, uv = vu, where q = pmfor a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr- 1) × R[x]/(xs- 1). For this family of codes we discuss the generator polynomials and minimal generating sets. We study the algebraic structure of separable codes. Further, we discuss the duality of this family of codes and determine their generator polynomials. We obtain several optimal and near-optimal codes from this study. As applications, we discuss a construction of quantum error-correcting codes (QECCs) from FqR-cyclic codes and construct some good QECCs.

IEEE Access•Jan 1, 2020•15 citations

On cyclic and negacyclic codes with one-dimensional hulls and their applications

Steven T. Dougherty, Serap Şahinkaya

Linear codes over finite fields with small dimensional hulls have received much attention due to their applications in cryptology and quantum computing. In this paper, we study cyclic and negacyclic codes with one-dimensional hulls. We determine precisely when cyclic and negacyclic codes over finite fields with one-dimensional hulls exist. We also introduce one-dimensional linear complementary pairs of cyclic and negacyclic codes. As an application, we obtain numerous optimal or near optimal cyclic codes with one-dimensional hulls over different fields and, by using these codes, we present new entanglement-assisted quantum error-correcting codes (EAQECCs). In particular, some of these EAQEC codes are maximal distance separable (MDS). We also obtain one-dimensional linear complementary pairs of cyclic codes, which are either optimal or near optimal.

Advances in Mathematics of Communications•Dec 6, 2022•7 citations

QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over $\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)$

Rabia Zengin, Mehmet E. Köroğlu

In this work, we determine the generator polynomials for the Hermitian hulls and Hermitian sums of cyclic codes defined over the composite ring $\mathbb{F}_2 \times (\mathbb{F}_2 + v\mathbb{F}_2)$, where $v^2 = v$. Based on these structures, we develop quantum error-correcting (QEC) codes by applying the Hermitian dual version of Quantum Construction~X to the obtained Hermitian hulls and sums. Moreover, by employing matrix product code methods on linear complementary dual (LCD) codes defined over the same ring, we derive families of entanglement-assisted quantum error-correcting (EAQEC) codes.

arXiv:2606.02137•Jun 1, 2026•0 citations

On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs

Lin Sok

The Euclidean hull of a linear code$C$is the intersection of$C$with its Euclidean dual$C^\perp $. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the automorphism group of a linear code and for checking permutation equivalence of two linear codes. The Euclidean hull of a linear code has been applied to the so-called entanglement-assisted quantum error-correcting codes (EAQECCs) via classical error-correcting codes. In this paper, we firstly consider linear codes with one-dimensional Euclidean hull from algebraic geometry codes, and then present a general method to construct linear codes with arbitrary dimensional Euclidean hull. Some new EAQECCs are presented.

arXiv:2101.06461•IEEE Transactions on Information Theory•Feb 23, 2022•44 citations
In this paper, we study the hulls of ZpZp[v]\mathbb{Z}_p\mathbb{Z}_p[v]Zp​Zp​[v]- cyclic codes for any prime ppp, where v2=vv^2 = vv2=v. Firstly, we derive the generator polynomials of the hulls of separable cyclic codes (SCCs) over ZpZp[v]\mathbb{Z}_p\mathbb{Z}_p[v]Zp​Zp​[v] and determine their dimensions using the concept of a generating function in combinatorics. We also enumerate the SCCs over ZpZp[v]\mathbb{Z}_p\mathbb{Z}_p[v]Zp​Zp​[v] with hulls of a fixed dimension. Next, we present the generator polynomials of the hulls of non-separable cyclic codes (NSCCs) over Z2Z2[v]\mathbb{Z}_2\mathbb{Z}_2[v]Z2​Z2​[v] with coprime odd block lengths and determine their dimensions. Additionally, we enumerate the NSCCs over Z2Z2[v]\mathbb{Z}_2\mathbb{Z}_2[v]Z2​Z2​[v] with hulls of a fixed dimension. As an application, we use the hulls of NSCCs over Z2Z2[v]\mathbb{Z}_2\mathbb{Z}_2[v]Z2​Z2​[v] to construct some good entanglement-assisted quantum error-correcting codes (EAQECCs).
Letq=peq=p^{e}q=pebe a prime power and$\ell $be an integer with0≤ℓ≤e−10\leq \ell \leq e-10≤ℓ≤e−1. The$\ell −GaloishullofclassicallinearcodesisageneralizationoftheEuclideanhullandHermitianhull.WeprovideanecessaryandsufficientconditionunderwhichacodewordofaGRScodeoranextendedGRScodebelongstoits-Galois hull of classical linear codes is a generalization of the Euclidean hull and Hermitian hull. We provide a necessary and sufficient condition under which a codeword of a GRS code or an extended GRS code belongs to its−GaloishullofclassicallinearcodesisageneralizationoftheEuclideanhullandHermitianhull.WeprovideanecessaryandsufficientconditionunderwhichacodewordofaGRScodeoranextendedGRScodebelongstoits\ell −Galoisdualcode,generalizingboththeEuclideancaseandHermitiancaseintheliterature.Byusingfourdifferenttools:1)thenormmappingfrom-Galois dual code, generalizing both the Euclidean case and Hermitian case in the literature. By using four different tools: 1) the norm mapping from−Galoisdualcode,generalizingboththeEuclideancaseandHermitiancaseintheliterature.Byusingfourdifferenttools:1)thenormmappingfrom\mathbb {F}_{q}^{\ast }tototo\mathbb {F}_{p^{\ell }}^{\ast };2)thedirectproductoftwocyclicsubgroups;3)thecosetdecompositionofacyclicgroup;4)anadditivesubgroupof; 2) the direct product of two cyclic subgroups; 3) the coset decomposition of a cyclic group; 4) an additive subgroup of;2)thedirectproductoftwocyclicsubgroups;3)thecosetdecompositionofacyclicgroup;4)anadditivesubgroupof\mathbb {F}_{q}anditscosets,weconstructelevenfamiliesofand its cosets, we construct eleven families ofanditscosets,weconstructelevenfamiliesofq−aryMDScodeswith-ary MDS codes with−aryMDScodeswith\ell −Galoishullsofarbitrarydimensions,andgivetherelatedelevenfamiliesof-Galois hulls of arbitrary dimensions, and give the related eleven families of−Galoishullsofarbitrarydimensions,andgivetherelatedelevenfamiliesof[[n,k,d;c]]_{q}$entanglement-assisted quantum error-correcting codes (EAQECCs) with relatively large minimum distance in the sense that2d=n−k+2+c2d=n-k+2+c2d=n−k+2+c. We show that developing the theory on$\ell −Galoishullsof-Galois hulls of−Galoishullsofq−aryMDScodesinthispaperenablesustoobtainnew-ary MDS codes in this paper enables us to obtain new−aryMDScodesinthispaperenablesustoobtainnewq−aryEAQECCswithdifferentkindsoflengthsetsviadifferent-ary EAQECCs with different kinds of length sets via different−aryEAQECCswithdifferentkindsoflengthsetsviadifferent\ell $, where2ℓ∣e2\ell \mid e2ℓ∣e.
Let R = Fq+ uFq+ vFq+ uvFq, with u2= u, v2= v, uv = vu, where q = pmfor a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr- 1) × R[x]/(xs- 1). For this family of codes we discuss the generator polynomials and minimal generating sets. We study the algebraic structure of separable codes. Further, we discuss the duality of this family of codes and determine their generator polynomials. We obtain several optimal and near-optimal codes from this study. As applications, we discuss a construction of quantum error-correcting codes (QECCs) from FqR-cyclic codes and construct some good QECCs.
Linear codes over finite fields with small dimensional hulls have received much attention due to their applications in cryptology and quantum computing. In this paper, we study cyclic and negacyclic codes with one-dimensional hulls. We determine precisely when cyclic and negacyclic codes over finite fields with one-dimensional hulls exist. We also introduce one-dimensional linear complementary pairs of cyclic and negacyclic codes. As an application, we obtain numerous optimal or near optimal cyclic codes with one-dimensional hulls over different fields and, by using these codes, we present new entanglement-assisted quantum error-correcting codes (EAQECCs). In particular, some of these EAQEC codes are maximal distance separable (MDS). We also obtain one-dimensional linear complementary pairs of cyclic codes, which are either optimal or near optimal.
QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over F2×(F2+vF2)\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)F2​×(F2​+vF2​)
In this work, we determine the generator polynomials for the Hermitian hulls and Hermitian sums of cyclic codes defined over the composite ring F2×(F2+vF2)\mathbb{F}_2 \times (\mathbb{F}_2 + v\mathbb{F}_2)F2​×(F2​+vF2​), where v2=vv^2 = vv2=v. Based on these structures, we develop quantum error-correcting (QEC) codes by applying the Hermitian dual version of Quantum Construction~X to the obtained Hermitian hulls and sums. Moreover, by employing matrix product code methods on linear complementary dual (LCD) codes defined over the same ring, we derive families of entanglement-assisted quantum error-correcting (EAQEC) codes.
The Euclidean hull of a linear codeCCCis the intersection ofCCCwith its Euclidean dual$C^\perp $. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the automorphism group of a linear code and for checking permutation equivalence of two linear codes. The Euclidean hull of a linear code has been applied to the so-called entanglement-assisted quantum error-correcting codes (EAQECCs) via classical error-correcting codes. In this paper, we firstly consider linear codes with one-dimensional Euclidean hull from algebraic geometry codes, and then present a general method to construct linear codes with arbitrary dimensional Euclidean hull. Some new EAQECCs are presented.