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

arXiv:2609.26633

Annihilator and twisted Euclidean duality for quasi-polycyclic codes

Tushar Bag, Edgar Martínez-Moro, Daniel Panario

Published Sep 22, 2026• 1 citation
arXivHTMLPDF

Abstract

Let $f\in\mathbb F_q[x]$ be a monic polynomial of degree $m$ with $f(0)\ne 0$, and let $\mathcal R=\mathbb F_q[x]/\langle f\rangle$. Under coefficient expansion, a quasi-polycyclic (QP) code of index $n$ corresponds to an $\mathcal R$-submodule of $\mathcal R^n$. In this paper, we study QP codes with respect to the annihilator duality. We show that this form is non-degenerate and that the annihilator dual of a QP code is again a QP code. We also give an equivalent description of the dual in terms of the $\mathcal R$-valued dot product, which leads to self-orthogonality criteria. We determine the Gram matrix of the annihilator form and obtain an explicit formula for its determinant. In coefficient coordinates, this shows that the annihilator dual can be viewed as a twisted Euclidean dual. Using this description, we characterize when a coordinatewise $\mathbb F_q$-linear map converts annihilator duality into ordinary Euclidean duality. For squarefree $f$, we show that annihilator duality decomposes into ordinary Euclidean duality on the components arising from the Chinese Remainder Theorem. This gives simple criteria for self-orthogonal, self-dual, dual-containing, and complementary-dual QP codes. We show how the annihilator dual interacts with the Hamming weight enumerator and compute the MacWilliams transform associated with that duality. Finally, we apply these results to Calderbank--Shor--Steane and Steane-enlarged quantum-code constructions over $\mathcal R$ and, when a suitable duality-preserving coordinate map exists, over $\mathbb F_q$. This gives binary and ternary stabilizer codes with minimum-distance lower bounds matching the best known bounds, most of which arise from rings $\mathcal R$ that are not fields.

DOI
10.48550/arxiv.2609.26633

Related papers

Polycyclic Codes and Their Application in Constructing AEAQECCs

Juan Li, Yunbo Tian, Fanghui Ma

In this article, we study polycyclic codes over the ring R=Fq[v]/⟨v2−1⟩, where q=pm with p being an odd prime. First, we introduce polycyclic codes and sequential codes over R, and characterize the structural properties of these polycyclic codes. Next, we analyze the Euclidean dual codes, annihilator dual codes, annihilator self-orthogonal codes, and annihilator linear complementary dual (LCD) codes associated with this family of codes. Finally, some asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) are constructed from polycyclic codes over R. Moreover, the parameters of our AEAQECCs are new in the existing literature.

Axioms•Feb 2, 2026•0 citations

$ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $ -cyclic codes over $ \mathbb{F}_q^l $ and their application to construct quantum codes

Akanksha Tiwari, Anuj Kumar Bhagat, Ritumoni Sarma

In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.

arXiv:2501.01708•Advances in Mathematics of Communications•Jan 1, 2026•1 citation

Hermitian Hulls of Cyclic Codes and Exact Dual Distances of Extended Linear Codes

Liangdong Lu, Ruipan Yang, Yang Liu +2 more

Let $\mathcal{C}$ be an $[n,k,d]$ linear code over $\F_{q^2}$ with parity-check matrix $H$. The rank $r=\Rank(HH^{\dagger})$ measures how far the Hermitian dual $\mathcal{C}^{\perp_h}$ is from being Hermitian self-orthogonal, and it is the least number of coordinates that must be adjoined to $\mathcal{C}^{\perp_h}$ to make it Hermitian self-orthogonal; equivalently, the Hermitian hull $\mathcal{C}\cap\mathcal{C}^{\perp_h}$ has dimension $(n-k)-r$. In this paper, we develop a structure theory of the Hermitian hull of a cyclic code and apply it to the construction of quantum stabilizer codes. For a cyclic code with defining set $T\subseteq\mathbb{Z}_n$, we show that $r$ is additive over the orbits of the involution $τ(ν)=-qν$ on the $q^2$-cyclotomic cosets and satisfies a parity constraint. A parameter dictionary exhibits $r$ as a gauge trading one-for-one against the code length, and a complementation duality shows that the complement of $T$ realises the logical-qubit count of the quantum code. The extreme values of $r$ are settled by closed subset-sum criteria, and the $τ$-invariant defining sets are shown to be the unique locus on which the Hermitian dual is again cyclic. On the distance side, we determine the Hermitian dual distance of an $r$-fold extension of an arbitrary linear code exactly, and we prove that the admissible extension vectors lie in the image of $HH^{\dagger}$, which reduces the search space from $q^{2(n-k)}$ to $q^{2r}$. Applied to cyclic, quasi-cyclic and BCH codes, the construction improves $23$ best-known parameters in Grassl's code tables, one of them provably optimal.

cs.ITCross-listedarXiv:2607.12242•Jul 15, 2026•0 citations

A Construction of Infinite Families of Good Self-Orthogonal Quasi-Cyclic Codes

Bastos, Gustavo Terra, Álvarez, Angelynn, Williams, Cameron

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to the Euclidean and Hermitian inner products. In particular, their dimension and a lower bound for their minimum distance are computed using their constituent codes defined over field extensions of $\mathbb{F}_q$. We also show that the lower bound for the minimum distance satisfies the square-root-like lower bound and also show how dual-containing and self-dual quasi-cyclic codes can arise from our construction. Using the CSS construction, we show the existence of quantum error-correcting codes with good parameters.

arXiv:2511.02813•Nov 4, 2025•0 citations

New quantum codes from skew constacyclic codes

Ram Krishna Verma, Om Prakash, Ashutosh Singh +1 more

For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.

Advances in Mathematics of Communications•Aug 19, 2021•21 citations

Quantum synchronizable codes, polynomial and quasi-polynomial shifts

Edgar Martínez-Moro, Miguel de los Ríos de Antonio

Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.

arXiv:2611.10903•Nov 7, 2026•0 citations
Let f∈Fq[x]f\in\mathbb F_q[x]f∈Fq​[x] be a monic polynomial of degree mmm with f(0)≠0f(0)\ne 0f(0)=0, and let R=Fq[x]/⟨f⟩\mathcal R=\mathbb F_q[x]/\langle f\rangleR=Fq​[x]/⟨f⟩. Under coefficient expansion, a quasi-polycyclic (QP) code of index nnn corresponds to an R\mathcal RR-submodule of Rn\mathcal R^nRn. In this paper, we study QP codes with respect to the annihilator duality. We show that this form is non-degenerate and that the annihilator dual of a QP code is again a QP code. We also give an equivalent description of the dual in terms of the R\mathcal RR-valued dot product, which leads to self-orthogonality criteria. We determine the Gram matrix of the annihilator form and obtain an explicit formula for its determinant. In coefficient coordinates, this shows that the annihilator dual can be viewed as a twisted Euclidean dual. Using this description, we characterize when a coordinatewise Fq\mathbb F_qFq​-linear map converts annihilator duality into ordinary Euclidean duality. For squarefree fff, we show that annihilator duality decomposes into ordinary Euclidean duality on the components arising from the Chinese Remainder Theorem. This gives simple criteria for self-orthogonal, self-dual, dual-containing, and complementary-dual QP codes. We show how the annihilator dual interacts with the Hamming weight enumerator and compute the MacWilliams transform associated with that duality. Finally, we apply these results to Calderbank--Shor--Steane and Steane-enlarged quantum-code constructions over R\mathcal RR and, when a suitable duality-preserving coordinate map exists, over Fq\mathbb F_qFq​. This gives binary and ternary stabilizer codes with minimum-distance lower bounds matching the best known bounds, most of which arise from rings R\mathcal RR that are not fields.
In this article, we study polycyclic codes over the ring R=Fq[v]/⟨v2−1⟩, where q=pm with p being an odd prime. First, we introduce polycyclic codes and sequential codes over R, and characterize the structural properties of these polycyclic codes. Next, we analyze the Euclidean dual codes, annihilator dual codes, annihilator self-orthogonal codes, and annihilator linear complementary dual (LCD) codes associated with this family of codes. Finally, some asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) are constructed from polycyclic codes over R. Moreover, the parameters of our AEAQECCs are new in the existing literature.
In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.
Let C\mathcal{C}C be an [n,k,d][n,k,d][n,k,d] linear code over $\F_{q^2}$ with parity-check matrix HHH. The rank $r=\Rank(HH^{\dagger})$ measures how far the Hermitian dual C⊥h\mathcal{C}^{\perp_h}C⊥h​ is from being Hermitian self-orthogonal, and it is the least number of coordinates that must be adjoined to C⊥h\mathcal{C}^{\perp_h}C⊥h​ to make it Hermitian self-orthogonal; equivalently, the Hermitian hull C∩C⊥h\mathcal{C}\cap\mathcal{C}^{\perp_h}C∩C⊥h​ has dimension (n−k)−r(n-k)-r(n−k)−r. In this paper, we develop a structure theory of the Hermitian hull of a cyclic code and apply it to the construction of quantum stabilizer codes. For a cyclic code with defining set T⊆ZnT\subseteq\mathbb{Z}_nT⊆Zn​, we show that rrr is additive over the orbits of the involution τ(ν)=−qντ(ν)=-qντ(ν)=−qν on the q2q^2q2-cyclotomic cosets and satisfies a parity constraint. A parameter dictionary exhibits rrr as a gauge trading one-for-one against the code length, and a complementation duality shows that the complement of TTT realises the logical-qubit count of the quantum code. The extreme values of rrr are settled by closed subset-sum criteria, and the τττ-invariant defining sets are shown to be the unique locus on which the Hermitian dual is again cyclic. On the distance side, we determine the Hermitian dual distance of an rrr-fold extension of an arbitrary linear code exactly, and we prove that the admissible extension vectors lie in the image of HH†HH^{\dagger}HH†, which reduces the search space from q2(n−k)q^{2(n-k)}q2(n−k) to q2rq^{2r}q2r. Applied to cyclic, quasi-cyclic and BCH codes, the construction improves 232323 best-known parameters in Grassl's code tables, one of them provably optimal.
Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to the Euclidean and Hermitian inner products. In particular, their dimension and a lower bound for their minimum distance are computed using their constituent codes defined over field extensions of Fq\mathbb{F}_qFq​. We also show that the lower bound for the minimum distance satisfies the square-root-like lower bound and also show how dual-containing and self-dual quasi-cyclic codes can arise from our construction. Using the CSS construction, we show the existence of quantum error-correcting codes with good parameters.
For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.
Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.