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

Discrete Mathematics Algorithms and Applications

On the Galois dual of one-generator quasi-monomial codes

Oussama Kabbouch, Lhousain Mouatadid, Mustapha Najmeddine, Nuh Aydın

Published Nov 4, 2026• 0 citations
Publisher

Abstract

In this paper, we study 1-generator quasi-monomial (QM) codes over finite fields, where we describe the Galois dual codes of 1-generator QM codes of index 2. We show that 1-generator QM codes are Galois self-orthogonal under certain conditions. We investigate certain maximum distance separable quantum codes (quantum MDS codes) and certain almost maximum distance separable quantum codes (quantum AMDS codes). Moreover, we present many examples of quantum codes with good parameters, including new MDS and AMDS codes over various finite fields.

DOI
10.1142/s1793830926501107

Related papers

Quantum Codes Derived from One-Generator Quasi-Twisted Codes

Akram Saleh, M. Reza Soleymani

In this paper, we investigate one-generator quasi-twisted (QT) codes of index 3 over finite fields. Our objective is to characterize the dual code for this class of codes in terms of Hermitian inner product. We also establish sufficient conditions for self-orthogonality of these codes with respect to this inner product. As a result of our findings, we present examples of quantum error-correcting codes (QECCs) with good and optimal parameters derived from this family of QT codes.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•2 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

Symplectic Self-Orthogonal Quasi-Cyclic Codes

Chaofeng Guan, Ruihu Li, Jingjie Lv +1 more

In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a class of 1-generator QC codes and their symplectic dual codes by decomposing code spaces. As an application, we construct many new binary symplectic self-orthogonal QC codes with excellent parameters, leading to 117 record-breaking quantum error-correction codes.

arXiv:2212.14225•IEEE Transactions on Information Theory•Nov 13, 2024•16 citations

Quantum codes construction from skew polycyclic codes

Shikha Patel, Om Prakash

This paper establishes the relation between skew polycyclic and skew sequential codes over a finite field. We prove with different induced vectors that right Θ-polycyclic codes are left Θ−1-polycyclic codes. Further, we characterize the condition under which a code is both left and right skew polycyclic with the same induced vectors. Moreover, an analogous study is also discussed for skew sequential codes. Further, to show the novelty of our work, many examples of "MDS (Maximum Distance Separable)" codes are provided. Finally, as an application, we construct quantum codes with good parameters from these codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•3 citations

An explicit construction of quantum codes from one-generator generalized quasi-cyclic codes

Yu Yao, Yuena Ma, Husheng Li +1 more

In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of index 2 to construct quantum error-correcting codes. By studying the form of Hermitian dual codes and their algebraic structure, we propose a sufficient condition for self-orthogonality of GQC codes with Hermitian inner product. By comparison, the quantum codes we constructed have better parameters than known codes.

MATEC Web of Conferences•Jan 1, 2021•0 citations

Classical self-orthogonal codes and their applications to quantum codes

Lingfei Jin

After the pioneering work of Shor and Steane, we are able to establish links between quantum codes and classical codes with certain self-orthogonality. Therefore, constructing classical self-orthogonal codes with small dimension and large dual distance becomes our centre point due to the interesting application to quantum codes. \n \n \n \nOne of the most interesting and useful families of classical codes are MDS codes. We will show a systematic construction for classical Hermitian self-orthogonal MDS codes through generalized Reed-Solomn codes. Afterwards, new families of quantum MDS codes can be produced. \n \n \n \nClassical BCH codes would be another good choice for self-orthogonal codes. We show the dual containment through polynomial evaluations, simply by choosing suitable cyclotomic cosets. As a result, quantum codes with good parameters can be derived. \n \n \n \nAnother good candidate of classical codes to investigate for dual containment comes from the class of \n \nalgebraic geometry codes. Instead of testing for dual containment directly, this thesis explores an equivalent condition for the existence of self-orthogonal AG codes. \n \n \n \nAfter various constructions for quantum codes, this thesis ends with a study on bounds for estimating the parameters of codes.

•Jan 1, 2013•0 citations
In this paper, we study 1-generator quasi-monomial (QM) codes over finite fields, where we describe the Galois dual codes of 1-generator QM codes of index 2. We show that 1-generator QM codes are Galois self-orthogonal under certain conditions. We investigate certain maximum distance separable quantum codes (quantum MDS codes) and certain almost maximum distance separable quantum codes (quantum AMDS codes). Moreover, we present many examples of quantum codes with good parameters, including new MDS and AMDS codes over various finite fields.
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​​⌉.
In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a class of 1-generator QC codes and their symplectic dual codes by decomposing code spaces. As an application, we construct many new binary symplectic self-orthogonal QC codes with excellent parameters, leading to 117 record-breaking quantum error-correction codes.
This paper establishes the relation between skew polycyclic and skew sequential codes over a finite field. We prove with different induced vectors that right Θ-polycyclic codes are left Θ−1-polycyclic codes. Further, we characterize the condition under which a code is both left and right skew polycyclic with the same induced vectors. Moreover, an analogous study is also discussed for skew sequential codes. Further, to show the novelty of our work, many examples of "MDS (Maximum Distance Separable)" codes are provided. Finally, as an application, we construct quantum codes with good parameters from these codes.
After the pioneering work of Shor and Steane, we are able to establish links between quantum codes and classical codes with certain self-orthogonality. Therefore, constructing classical self-orthogonal codes with small dimension and large dual distance becomes our centre point due to the interesting application to quantum codes. \n \n \n \nOne of the most interesting and useful families of classical codes are MDS codes. We will show a systematic construction for classical Hermitian self-orthogonal MDS codes through generalized Reed-Solomn codes. Afterwards, new families of quantum MDS codes can be produced. \n \n \n \nClassical BCH codes would be another good choice for self-orthogonal codes. We show the dual containment through polynomial evaluations, simply by choosing suitable cyclotomic cosets. As a result, quantum codes with good parameters can be derived. \n \n \n \nAnother good candidate of classical codes to investigate for dual containment comes from the class of \n \nalgebraic geometry codes. Instead of testing for dual containment directly, this thesis explores an equivalent condition for the existence of self-orthogonal AG codes. \n \n \n \nAfter various constructions for quantum codes, this thesis ends with a study on bounds for estimating the parameters of codes.