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:2101.06461 · IEEE Transactions on Information Theory

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

Lin Sok

Published Feb 23, 2022• 48 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tit.2022.3152580

Related papers

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

On Galois hulls of linear codes and new entanglement-assisted quantum error-correcting codes

Yang Li, Shixin Zhu

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the dimensions of Galois hulls of linear codes is found. Some new necessary and sufficient conditions for linear codes being Galois self-orthogonal codes, Galois self-dual codes, and Galois linear complementary dual codes are characterized. Then, we propose explicit methods to construct Galois self-orthogonal codes of larger length from given Galois self-orthogonal codes. As an application, linear codes of larger length with Galois hulls of arbitrary dimensions are further derived. Focusing on the Hermitian inner product, two new classes of Hermitian self-orthogonal maximum distance separable (MDS) codes are also constructed. Finally, applying all the results to the construction of entanglement-assisted quantum error-correcting codes (EAQECCs), many new $q$-ary or $\sqrt{q}$-ary EAQECCs and MDS EAQECCs with rates greater than or equal to $\frac{1}{2}$ and positive net rates can be obtained. Moreover, the minimum distance of many $\sqrt{q}$-ary MDS EAQECCs of length $n>\sqrt{q}+1$ is greater than or equal to $\lceil \frac{\sqrt{q}}{2} \rceil$.

arXiv:2207.02535•Jul 6, 2022•2 citations

Construction of linear codes with various Hermitian hull dimensions and related EAQECCs

Ruowen Liu, Shitao Li, Minjia Shi

The hull of a linear code is the intersection of the code and its dual code, which is effective for determining parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). There are few constructions of linear codes with various Hermitian hull dimensions, aside from Hermitian LCD and self-orthogonal codes. The object of this paper is to introduce a building-up construction for constructing linear $ [n+2, k+1] $ codes with $ \ell $ or $ (\ell+1) $-dimensional Hermitian hull from a given linear $ [n, k] $ code with $ \ell $-dimension Hermitian hull of a smaller length. This construction includes the converse of the famous shortening technique as a special case. Using this method, we construct optimal quaternary linear codes of lengths up to 13 with Hermitian hull dimensions 2-5. As an application, we construct many EAQECCs, which improve the parameters of EAQECCs of Grassl's code table.

Advances in Mathematics of Communications•Mar 29, 2024•5 citations

Hulls of special typed linear codes and constructions of new EAQECCs

Lin Sok

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS linear codes for which their hull dimensions are well determined. As an application, we provide several classes of entanglement-assisted quantum error correcting codes with new parameters.

arXiv:2207.07792•Jul 16, 2022•3 citations

Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs

Weijun Fang, Fang-Wei Fu, Lanqiang Li +1 more

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q+1 are also obtained.

arXiv:1812.09019•IEEE Transactions on Information Theory•Oct 30, 2019•114 citations

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•51 citations
The Euclidean hull of a linear codeCCCis the intersection ofCCCwith its Euclidean dualC⊥C^\perp C⊥. 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.
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.
The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the dimensions of Galois hulls of linear codes is found. Some new necessary and sufficient conditions for linear codes being Galois self-orthogonal codes, Galois self-dual codes, and Galois linear complementary dual codes are characterized. Then, we propose explicit methods to construct Galois self-orthogonal codes of larger length from given Galois self-orthogonal codes. As an application, linear codes of larger length with Galois hulls of arbitrary dimensions are further derived. Focusing on the Hermitian inner product, two new classes of Hermitian self-orthogonal maximum distance separable (MDS) codes are also constructed. Finally, applying all the results to the construction of entanglement-assisted quantum error-correcting codes (EAQECCs), many new qqq-ary or q\sqrt{q}q​-ary EAQECCs and MDS EAQECCs with rates greater than or equal to 12\frac{1}{2}21​ and positive net rates can be obtained. Moreover, the minimum distance of many q\sqrt{q}q​-ary MDS EAQECCs of length n>q+1n>\sqrt{q}+1n>q​+1 is greater than or equal to ⌈q2⌉\lceil \frac{\sqrt{q}}{2} \rceil⌈2q​​⌉.
The hull of a linear code is the intersection of the code and its dual code, which is effective for determining parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). There are few constructions of linear codes with various Hermitian hull dimensions, aside from Hermitian LCD and self-orthogonal codes. The object of this paper is to introduce a building-up construction for constructing linear $ [n+2, k+1] $ codes with $ \ell $ or $ (\ell+1) $-dimensional Hermitian hull from a given linear $ [n, k] $ code with $ \ell $-dimension Hermitian hull of a smaller length. This construction includes the converse of the famous shortening technique as a special case. Using this method, we construct optimal quaternary linear codes of lengths up to 13 with Hermitian hull dimensions 2-5. As an application, we construct many EAQECCs, which improve the parameters of EAQECCs of Grassl's code table.
In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q+1 are also obtained.
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.