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

Finite Fields and Their Applications

Galois self-orthogonal Gray images of linear codes over Fq[u]〈u2〉: Applications to EAQECCs, intersecting codes and trellis complexities

Leijo Jose, Lavanya G, Anuradha Sharma

Published Jul 30, 2026• 0 citations
Publisher
DOI
10.1016/j.ffa.2026.102887

Related papers

Galois self-orthogonal constacyclic codes over finite fields

Yuqing Fu, Hongwei Liu

Designs Codes and Cryptography•Oct 28, 2021•12 citations

Matrix-product constructions for Galois self-orthogonal codes and new quantum codes

Liqi Wang, Xinxin Zhang, Shixin Zhu

Computational and Applied Mathematics•Jul 22, 2025•2 citations

Linear codes with arbitrary dimensional hull and their applications to EAQECCs

Lin Sok, Gang Qian

Quantum Information Processing•Jan 28, 2022•26 citations

New Galois Hulls of GRS Codes and Application to EAQECCs

Xiaolei Fang, Renjie Jin, Jinquan Luo +1 more

arXiv:2011.14061•Cryptography and Communications•Aug 27, 2021•24 citations

Galois self-orthogonal and Galois LCD one-generator $$(\bar{\lambda },\theta ,\ell )$$-monomial codes

Oussama Kabbouch, Lhousain Mouatadid, Mustapha Najmeddine +1 more

Quantum Information Processing•Nov 3, 2025•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
Galois self-orthogonal and Galois LCD one-generator (λˉ,θ,ℓ)(\bar{\lambda },\theta ,\ell )(λˉ,θ,ℓ)-monomial codes
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​​⌉.