New Constacyclic Constructions and Multiplier Classification of Optimal Asymmetric Entanglement-Assisted Quantum Codes

Let q be a power of a prime p, n≥2 with gcd(n,q)=1, and λ∈Fq2×. We associate a λ-constacyclic code C0 with a λ−q-constacyclic code C1, removing the restriction λq+1=1 from Hermitian constacyclic constructions. Their spectral supports determine both relative Hermitian hulls and the cross-Gram rank ρ, and an orbit product counts pairs by (k0,k1,ρ), where ki=dimCi. For positive quantum dimension, the pair gives an asymmetric entanglement-assisted code [[n,n−k0−k1+ρ,dz/dx;ρ]]q2. MDS constituents give exact distances dz=k1+1 and dx=k0+1; relative weight enumerators determine the distances and purity otherwise. If nr∣q2−1, where r=ord(λ), MDS constituents realize every admissible triple. At n=q2−1, we characterize Hermitian cross-orthogonal interval supports. For odd q and even n∣q2+1, square (sq) multipliers realize the pure MDS family [[n,k,(n−k+1)/(v+1);v]]q2 for positive odd k,v with v≤n−k, and [[n,n−2,2/2]]q2 for n≥4; non-square (nsq) multipliers realize the same family for even k,v≥2 with v≤n−k. On k=n−v with even 2≤v≤n−2, the non-square class attains dz+dx=2v+2, whereas the square class satisfies dz+dx≤2v. These results identify constacyclic realizations and multiplier obstructions within known quantum MDS parameter ranges.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2026-11-19
DOI
https://doi.org/10.3390/axioms15110868
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
NOV
article

New Constacyclic Constructions and Multiplier Classification of Optimal Asymmetric Entanglement-Assisted Quantum Codes

Sami Alabiad
Axioms
Coding theory and cryptography
article

New Constacyclic Constructions and Multiplier Classification of Optimal Asymmetric Entanglement-Assisted Quantum Codes

Sami Alabiad
article en

Abstract

Let q be a power of a prime p, n≥2 with gcd(n,q)=1, and λ∈Fq2×. We associate a λ-constacyclic code C0 with a λ−q-constacyclic code C1, removing the restriction λq+1=1 from Hermitian constacyclic constructions. Their spectral supports determine both relative Hermitian hulls and the cross-Gram rank ρ, and an orbit product counts pairs by (k0,k1,ρ), where ki=dimCi. For positive quantum dimension, the pair gives an asymmetric entanglement-assisted code [[n,n−k0−k1+ρ,dz/dx;ρ]]q2. MDS constituents give exact distances dz=k1+1 and dx=k0+1; relative weight enumerators determine the distances and purity otherwise. If nr∣q2−1, where r=ord(λ), MDS constituents realize every admissible triple. At n=q2−1, we characterize Hermitian cross-orthogonal interval supports. For odd q and even n∣q2+1, square (sq) multipliers realize the pure MDS family [[n,k,(n−k+1)/(v+1);v]]q2 for positive odd k,v with v≤n−k, and [[n,n−2,2/2]]q2 for n≥4; non-square (nsq) multipliers realize the same family for even k,v≥2 with v≤n−k. On k=n−v with even 2≤v≤n−2, the non-square class attains dz+dx=2v+2, whereas the square class satisfies dz+dx≤2v. These results identify constacyclic realizations and multiplier obstructions within known quantum MDS parameter ranges.

AxiomsVol. 15(11)
King Saud University (SA)
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.

Laika access coming soon