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β€’ 3 citations
arXivHTMLPDF

Abstract

Let 𝔽 π‘ž 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 𝔽 π‘ž ⁑ [ 𝐺 ] . In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any 𝐷 𝑛 -code over 𝔽 π‘ž 2 , where 𝐷 𝑛 is a dihedral group of order 2 n with n not divisible by c h a r ⁑ ( 𝔽 π‘ž 2 ) , through a suitable Wedderburn-Artin decomposition of the group algebra 𝔽 π‘ž 2 ⁑ [ 𝐷 𝑛 ] , and we determine all distinct Hermitian self-orthogonal 𝐷 𝑛 -codes over 𝔽 π‘ž 2 . We also present a thorough representation of the Euclidean dual code of any 𝑄 𝑛 -code over 𝔽 π‘ž , where 𝑄 𝑛 is a generalised quaternion group of order 4 n not divisible by c h a r ⁑ ( 𝔽 π‘ž ) , via the Wedderburn-Artin decomposition of the group algebra 𝔽 π‘ž ⁑ [ 𝑄 𝑛 ] . In particular, since the semisimple group algebras 𝔽 π‘ž 2 ⁑ [ 𝑄 𝑛 ] and 𝔽 π‘ž 2 ⁑ [ 𝐷 2 ⁒ 𝑛 ] are isomorphic, then the Hermitian dual code of any 𝑄 𝑛 -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

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

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

Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes

Lingfei Jin, Chaoping Xing

In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characteristic is slightly less than n/2-g with n being the length of the code and g being the genus of the base curve, then it is equivalent to an Euclidean self-orthogonal code. Previously, such results required a strong condition on the existence of a certain differential. We also show a similar result on Hermitian self-orthogonal algebraic geometry codes. As a consequence, we can apply our result to quantum codes and obtain some good quantum codes. In particular, we obtain a q-ary quantum [[q+1,1]]-MDS code for an even power q which is essential for quantum secret sharing.

arXiv:1308.3575β€’IEEE Transactions on Information Theoryβ€’Dec 2, 2011β€’77 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

On the classification of Hermitian self-dual additive codes over GF(9)

Lars Eirik Danielsen

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes have so far received far less interest from coding theorists than self-dual additive codes over GF(4), which correspond to binary quantum codes. Self-dual additive codes over GF(9) have been classified up to length 8, and in this paper we extend the complete classification to codes of length 9 and 10. The classification is obtained by using a new algorithm that combines two graph representations of self-dual additive codes. The search space is first reduced by the fact that every code can be mapped to a weighted graph, and a different graph is then introduced that transforms the problem of code equivalence into a problem of graph isomorphism. By an extension technique, we are able to classify all optimal codes of length 11 and 12. There are 56,005,876 (11,3^11,5) codes and 6493 (12,3^12,6) codes. We also find the smallest codes with trivial automorphism group.

arXiv:1106.2428β€’Jun 13, 2011β€’2 citations

On the Hermitian Hulls of One-Point Algebraic Geometry Codes and Their Application to EAQECCs

Lin Sok, San Ling

Algebraic geometry (AG) codes are an important class of linear codes for building standard quantum error-correcting codes (QECCs) when the Hermitian approach is applied to the former codes. Determining the Hermitian dual of an AG code remains an open problem in classical coding theory. Because of the lack of formulae for the Hermitian dual of an AG code, its Euclidean dual is used to derive its Hermitian dual, and this reduces the dimension and minimum distance of the classical code when the self-orthogonal condition is required, resulting in QECCs with small quantum distances. This lack also gives a challenge to constructing other types of quantum codes, such as entanglement-assisted quantum error-correcting codes (EAQECCs). In this article, we study the Hermitian hulls of one-point AG codes of a specific type, where we focus on the dimensions of the hulls. We provide several lower bounds on the hull dimensions of the one-point AG code and give explicit constructions. From AG codes with lower-bounded Hermitian hull dimensions, we derive a number of families of entanglement-assisted quantum codes from one-point AG codes, using the Hermitian approach and some propagation rules.

IEEE Transactions on Information Theoryβ€’Jan 1, 2026β€’0 citations
Let 𝔽 π‘ž 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 𝔽 π‘ž ⁑ [ 𝐺 ] . In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any 𝐷 𝑛 -code over 𝔽 π‘ž 2 , where 𝐷 𝑛 is a dihedral group of order 2 n with n not divisible by c h a r ⁑ ( 𝔽 π‘ž 2 ) , through a suitable Wedderburn-Artin decomposition of the group algebra 𝔽 π‘ž 2 ⁑ [ 𝐷 𝑛 ] , and we determine all distinct Hermitian self-orthogonal 𝐷 𝑛 -codes over 𝔽 π‘ž 2 . We also present a thorough representation of the Euclidean dual code of any 𝑄 𝑛 -code over 𝔽 π‘ž , where 𝑄 𝑛 is a generalised quaternion group of order 4 n not divisible by c h a r ⁑ ( 𝔽 π‘ž ) , via the Wedderburn-Artin decomposition of the group algebra 𝔽 π‘ž ⁑ [ 𝑄 𝑛 ] . In particular, since the semisimple group algebras 𝔽 π‘ž 2 ⁑ [ 𝑄 𝑛 ] and 𝔽 π‘ž 2 ⁑ [ 𝐷 2 ⁒ 𝑛 ] are isomorphic, then the Hermitian dual code of any 𝑄 𝑛 -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.
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.
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.
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characteristic is slightly less than n/2-g with n being the length of the code and g being the genus of the base curve, then it is equivalent to an Euclidean self-orthogonal code. Previously, such results required a strong condition on the existence of a certain differential. We also show a similar result on Hermitian self-orthogonal algebraic geometry codes. As a consequence, we can apply our result to quantum codes and obtain some good quantum codes. In particular, we obtain a q-ary quantum [[q+1,1]]-MDS code for an even power q which is essential for quantum secret sharing.
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.
Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes have so far received far less interest from coding theorists than self-dual additive codes over GF(4), which correspond to binary quantum codes. Self-dual additive codes over GF(9) have been classified up to length 8, and in this paper we extend the complete classification to codes of length 9 and 10. The classification is obtained by using a new algorithm that combines two graph representations of self-dual additive codes. The search space is first reduced by the fact that every code can be mapped to a weighted graph, and a different graph is then introduced that transforms the problem of code equivalence into a problem of graph isomorphism. By an extension technique, we are able to classify all optimal codes of length 11 and 12. There are 56,005,876 (11,3^11,5) codes and 6493 (12,3^12,6) codes. We also find the smallest codes with trivial automorphism group.
Algebraic geometry (AG) codes are an important class of linear codes for building standard quantum error-correcting codes (QECCs) when the Hermitian approach is applied to the former codes. Determining the Hermitian dual of an AG code remains an open problem in classical coding theory. Because of the lack of formulae for the Hermitian dual of an AG code, its Euclidean dual is used to derive its Hermitian dual, and this reduces the dimension and minimum distance of the classical code when the self-orthogonal condition is required, resulting in QECCs with small quantum distances. This lack also gives a challenge to constructing other types of quantum codes, such as entanglement-assisted quantum error-correcting codes (EAQECCs). In this article, we study the Hermitian hulls of one-point AG codes of a specific type, where we focus on the dimensions of the hulls. We provide several lower bounds on the hull dimensions of the one-point AG code and give explicit constructions. From AG codes with lower-bounded Hermitian hull dimensions, we derive a number of families of entanglement-assisted quantum codes from one-point AG codes, using the Hermitian approach and some propagation rules.