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:2512.07354 · Finite Fields and Their Applications

Dualities of dihedral and generalised quaternion codes and applications to quantum codes

Miguel Sales-Cabrera, Xaro Soler-Escrivà, Víctor Sotomayor

Published Sep 25, 2026• 0 citations
arXivHTMLPDF

Abstract

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any $D_n$-code over $\mathbb{F}_{q^2}$, where $D_n$ is a dihedral group of order $2n$ with $n$ not divisible by $\operatorname{char}(\mathbb{F}_{q^2})$, through a suitable Wedderburn-Artin decomposition of the group algebra $\mathbb{F}_{q^2}[D_n]$, and we determine all distinct Hermitian self-orthogonal $D_n$-codes over $\mathbb{F}_{q^2}$. We also present a thorough representation of the Euclidean dual code of any $Q_n$-code over $\mathbb{F}_q$, where $Q_n$ is a generalised quaternion group of order $4n$ not divisible by $\operatorname{char}(\mathbb{F}_q)$, via the Wedderburn-Artin decomposition of the group algebra $\mathbb{F}_q[Q_n]$. In particular, since the semisimple group algebras $\mathbb{F}_{q^2}[Q_n]$ and $\mathbb{F}_{q^2}[D_{2n}]$ are isomorphic, then the Hermitian dual code of any $Q_n$-code has also been fully described. As an application of the Hermitian dualities computed, we give a systematic construction, via the structure of the group algebra, to obtain quantum error-correcting codes, and in fact, with this methodical approach, we recover some already known quantum codes that achieve the best known minimum distance for their length and dimension.

DOI
10.1016/j.ffa.2026.102926

Related papers

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•19 citations

Quantum Codes from Group Codes

Kanat Abdukhalikov, Tushar Bag, Daniel Panario

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring F q [x, y]/⟨x l -1, y m -1⟩. These two-dimensional cyclic codes can be analyzed using the group ring F q (C l × C m ), where C l and C m represent cyclic groups of orders l and m, respectively. The aim is to show that studying group ring codes provides a more compact approach compared to the quotient ring method. We further extend this group ring framework to study codes over other group structures, such as the dihedral group, direct products of cyclic and dihedral groups, direct products of two cyclic groups, and semidirect products of two groups. Additionally, we explore necessary and sufficient conditions for such group ring codes to be self-orthogonal under Euclidean, Hermitian, and symplectic inner products and propose a construction for quantum codes.

arXiv:2412.13616•Jan 1, 2024•0 citations

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal matrices and quasi-unitary matrices.

Meng Cao

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over $\mathbb{F}_{q}$ (resp. $\mathbb{F}_{q^{2}}$) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a $q$-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over $\mathbb{F}_{q}$ (resp. $\mathbb{F}_{q^{2}}$). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in \cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these newly constructed matrix-product codes.

•Dec 31, 2020•1 citation

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

Construction of [[n,n−4,3]]q quantum codes for odd prime power q

Ruihu Li, Zongben Xu

For each odd prime power $q$, let $4\ensuremath{\leqslant}n\ensuremath{\leqslant}{q}^{2}+1$. Hermitian self-orthogonal $[n,2,n\ensuremath{-}1]$ codes over ${\mathbf{F}}_{{q}^{2}}$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n\ensuremath{-}4,3]]{}_{q}$ quantum maximal-distance-separable (MDS) codes for $4\ensuremath{\leqslant}n\ensuremath{\leqslant}{q}^{2}+1$ are obtained.

arXiv:0906.2509•Physical Review A•Nov 16, 2010•47 citations

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
Let Fq\mathbb{F}_qFq​ be a finite field of qqq elements, for some prime power qqq, and let GGG be a finite group. A (left) group code, or simply a GGG-code, is a (left) ideal of the group algebra Fq[G]\mathbb{F}_q[G]Fq​[G]. In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any DnD_nDn​-code over Fq2\mathbb{F}_{q^2}Fq2​, where DnD_nDn​ is a dihedral group of order 2n2n2n with nnn not divisible by char⁡(Fq2)\operatorname{char}(\mathbb{F}_{q^2})char(Fq2​), through a suitable Wedderburn-Artin decomposition of the group algebra Fq2[Dn]\mathbb{F}_{q^2}[D_n]Fq2​[Dn​], and we determine all distinct Hermitian self-orthogonal DnD_nDn​-codes over Fq2\mathbb{F}_{q^2}Fq2​. We also present a thorough representation of the Euclidean dual code of any QnQ_nQn​-code over Fq\mathbb{F}_qFq​, where QnQ_nQn​ is a generalised quaternion group of order 4n4n4n not divisible by char⁡(Fq)\operatorname{char}(\mathbb{F}_q)char(Fq​), via the Wedderburn-Artin decomposition of the group algebra Fq[Qn]\mathbb{F}_q[Q_n]Fq​[Qn​]. In particular, since the semisimple group algebras Fq2[Qn]\mathbb{F}_{q^2}[Q_n]Fq2​[Qn​] and Fq2[D2n]\mathbb{F}_{q^2}[D_{2n}]Fq2​[D2n​] are isomorphic, then the Hermitian dual code of any QnQ_nQn​-code has also been fully described. As an application of the Hermitian dualities computed, we give a systematic construction, via the structure of the group algebra, to obtain quantum error-correcting codes, and in fact, with this methodical approach, we recover some already known quantum codes that achieve the best known minimum distance for their length and dimension.
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.
This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring F q [x, y]/⟨x l -1, y m -1⟩. These two-dimensional cyclic codes can be analyzed using the group ring F q (C l × C m ), where C l and C m represent cyclic groups of orders l and m, respectively. The aim is to show that studying group ring codes provides a more compact approach compared to the quotient ring method. We further extend this group ring framework to study codes over other group structures, such as the dihedral group, direct products of cyclic and dihedral groups, direct products of two cyclic groups, and semidirect products of two groups. Additionally, we explore necessary and sufficient conditions for such group ring codes to be self-orthogonal under Euclidean, Hermitian, and symplectic inner products and propose a construction for quantum codes.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over Fq\mathbb{F}_{q}Fq​ (resp. Fq2\mathbb{F}_{q^{2}}Fq2​) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a qqq-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over Fq\mathbb{F}_{q}Fq​ (resp. Fq2\mathbb{F}_{q^{2}}Fq2​). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in \cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these newly constructed matrix-product codes.
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.
For each odd prime power qqq, let $4\ensuremath{\leqslant}n\ensuremath{\leqslant}{q}^{2}+1$. Hermitian self-orthogonal $[n,2,n\ensuremath{-}1]$ codes over Fq2{\mathbf{F}}_{{q}^{2}}Fq2​ with dual distance three are constructed by using finite field theory. Hence, $[[n,n\ensuremath{-}4,3]]{}_{q}$ quantum maximal-distance-separable (MDS) codes for $4\ensuremath{\leqslant}n\ensuremath{\leqslant}{q}^{2}+1$ are obtained.
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.