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:2607.20805

New Criteria and Constructions for Self-Orthogonal Codes

Peng Wang, Ziling Heng

Published Jul 23, 2026• 0 citations
arXivHTMLPDF

Abstract

Self-orthogonal codes have attracted considerable attention owing to their applications in quantum error-correcting codes, linear complementary dual codes, and a variety of other fields. In this paper, we construct new families of self-orthogonal codes and self-orthogonal minimal codes by establishing criteria that characterize the self-orthogonality of certain linear codes. To this end, we first establish several new criteria for linear codes arising from the defining-set construction to be self-orthogonal. More specifically, for $q > 3$, we show that the code $\mathcal{C}_D$ is self-orthogonal whenever the defining set $D$ is $G$-invariant, where $G \subseteq \mathbb{F}_q^*$ and $|G| > 2$. For $q = 2, 3$, we characterize the self-orthogonality of $\mathcal{C}_D$ using certain character sums. By combining these criteria with partial difference sets, we construct several new families of self-orthogonal codes, which lead to optimal or almost optimal quantum codes. Secondly, via the action of a multiplicative subgroup $G \subseteq \mathbb{F}_q^*$ with $|G| > 2$ on the columns of a projective linear code, we construct self-orthogonal codes with flexible parameters. From their augmented codes, we derive quantum codes. By choosing suitable projective codes, we obtain optimal quantum codes with high parametric flexibility. Thirdly, we employ the characteristic function method to construct linear codes and establish criterion for their self-orthogonality. Based on this, we construct several classes of self-orthogonal minimal codes that violate the Ashikhmin-Barg condition, using vectorial dual-bent functions and $s$-plateaued functions.

DOI
10.48550/arxiv.2607.20805

Related papers

Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes

Xinran Wang, Ziling Heng

Self-orthogonal codes have nice applications in many areas including quantum codes, lattices and LCD codes. For a prime powerq, it is in general difficult to constructq-ary self-orthogonal codes. In the literature, there exists no simple method to judge whether a generalq-ary linear code is self-orthogonal or not. In this paper, we mainly present several families ofq-ary self-orthogonal codes and study their applications in quantum codes and LCD codes. Firstly, several families ofq-ary linear codes are constructed by some special defining sets. These codes are proved to be self-orthogonal. To this end, we determine the numbers of solutions of some systems of equations over finite fields. Secondly, three families ofq-ary quantum codes with unbounded length and minimum distance three are constructed from the self-orthogonal codes. These quantum codes are optimal according to the quantum Hamming bound. In particular, some of them have better parameters than known ones. Thirdly, several families ofq-ary LCD codes are constructed from the self-orthogonal codes. Many optimal or almost optimal binary and ternary LCD codes are produced by our constructions. Some binary and ternary LCD codes have better parameters than known ones.

IEEE Transactions on Information Theory•Nov 13, 2023•16 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

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

Cao, Meng

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. 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 [10-12]; 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 matrix-product codes.

arXiv:2012.15691•Dec 31, 2020•3 citations

Construction of Hermitian Self-Orthogonal Codes and Application

Yuezhen Ren, Ruihu Li, Hao Song

We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.

Mathematics•Jul 5, 2024•3 citations

New families of quantum stabilizer codes from Hermitian self-orthogonal algebraic geometry codes

Lin Sok

There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper, Hermitian self-orthogonal codes are studied from algebraic function fields. Sufficient conditions for the Hermitian self-orthogonality of an algebraic geometry code are presented. New Hermitian self-orthogonal codes are constructed from projective lines, elliptic curves, hyper-elliptic curves, Hermitian curves, and Artin-Schreier curves. In addition, over the projective lines, we construct new families of MDS quantum codes with parameters $[[N,N-2K,K+1]]_q$ under the following conditions: i) $N=t(q-1)+1$ or $t(q-1)+2$ with $t|(q+1)$ and $K=\lfloor\frac{t(q-1)+1}{2t}\rfloor+1$; ii) $(n-1)|(q^2-1)$, $N=n$ or $N=n+1$, $K_0=\lfloor\frac{n+q-1}{q+1}\rfloor$, and $K\ge K_0+1$; iii) $N=tq+1$, $\forall~1\le t\le q$ and $K=\lfloor\frac{tq+q-1}{q+1}\rfloor+1$; iv) $n|(q^2-1)$, $n_2=\frac{n}{\gcd (n,q+1)}$, $\forall~ 1\le t\le \frac{q-1}{n_2}-1$, $N=(t+1)n+2$ and $K=\lfloor \frac{(t+1)n+1+q-1}{q+1}\rfloor+1$.

arXiv:2110.00769•Oct 2, 2021•3 citations

Self-Orthogonality of $q$-Ary Images of $q^{m}$-Ary Codes and Quantum Code Construction

B Sundeep, Andrew Thangaraj

A code over GF can be imaged or expanded into a code over GF using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems relating the properties of a code and its image with respect to a basis have been of great interest in the field of coding theory. In this work, a generalized version of the problem of self-orthogonality of the q-ary image of a qm-ary code has been considered. Given an inner product (more generally, a bi-additive form), necessary and sufficient conditions have been derived for a code over a field extension and an expansion basis so that an image of that code is self-orthogonal. The conditions require that the original code be self-orthogonal with respect to several related bi-additive forms whenever certain power sums of the dual basis elements do not vanish. Numerous interesting corollaries have been derived by specializing the general conditions. An interesting result for the canonical or regular inner product in fields of characteristic two is that only self-orthogonal codes result in self-orthogonal images. Another result is that image of a code is self-orthogonal for all bases if and only if trace of the code is self-orthogonal, except for the case of binary images of 4-ary codes. The conditions are particularly simple to state and apply for cyclic codes. To illustrate a possible application, new quantum error-correcting codes have been constructed with larger minimum distance than previously known.

arXiv:cs/0606106•IEEE Transactions on Information Theory•Jun 28, 2007•10 citations
Self-orthogonal codes have attracted considerable attention owing to their applications in quantum error-correcting codes, linear complementary dual codes, and a variety of other fields. In this paper, we construct new families of self-orthogonal codes and self-orthogonal minimal codes by establishing criteria that characterize the self-orthogonality of certain linear codes. To this end, we first establish several new criteria for linear codes arising from the defining-set construction to be self-orthogonal. More specifically, for q>3q > 3q>3, we show that the code CD\mathcal{C}_DCD​ is self-orthogonal whenever the defining set DDD is GGG-invariant, where G⊆Fq∗G \subseteq \mathbb{F}_q^*G⊆Fq∗​ and ∣G∣>2|G| > 2∣G∣>2. For q=2,3q = 2, 3q=2,3, we characterize the self-orthogonality of CD\mathcal{C}_DCD​ using certain character sums. By combining these criteria with partial difference sets, we construct several new families of self-orthogonal codes, which lead to optimal or almost optimal quantum codes. Secondly, via the action of a multiplicative subgroup G⊆Fq∗G \subseteq \mathbb{F}_q^*G⊆Fq∗​ with ∣G∣>2|G| > 2∣G∣>2 on the columns of a projective linear code, we construct self-orthogonal codes with flexible parameters. From their augmented codes, we derive quantum codes. By choosing suitable projective codes, we obtain optimal quantum codes with high parametric flexibility. Thirdly, we employ the characteristic function method to construct linear codes and establish criterion for their self-orthogonality. Based on this, we construct several classes of self-orthogonal minimal codes that violate the Ashikhmin-Barg condition, using vectorial dual-bent functions and sss-plateaued functions.
Self-orthogonal codes have nice applications in many areas including quantum codes, lattices and LCD codes. For a prime powerq, it is in general difficult to constructq-ary self-orthogonal codes. In the literature, there exists no simple method to judge whether a generalq-ary linear code is self-orthogonal or not. In this paper, we mainly present several families ofq-ary self-orthogonal codes and study their applications in quantum codes and LCD codes. Firstly, several families ofq-ary linear codes are constructed by some special defining sets. These codes are proved to be self-orthogonal. To this end, we determine the numbers of solutions of some systems of equations over finite fields. Secondly, three families ofq-ary quantum codes with unbounded length and minimum distance three are constructed from the self-orthogonal codes. These quantum codes are optimal according to the quantum Hamming bound. In particular, some of them have better parameters than known ones. Thirdly, several families ofq-ary LCD codes are constructed from the self-orthogonal codes. Many optimal or almost optimal binary and ternary LCD codes are produced by our constructions. Some binary and ternary LCD codes have better parameters than known ones.
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.
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. 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 [10-12]; 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 matrix-product codes.
We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.
There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper, Hermitian self-orthogonal codes are studied from algebraic function fields. Sufficient conditions for the Hermitian self-orthogonality of an algebraic geometry code are presented. New Hermitian self-orthogonal codes are constructed from projective lines, elliptic curves, hyper-elliptic curves, Hermitian curves, and Artin-Schreier curves. In addition, over the projective lines, we construct new families of MDS quantum codes with parameters [[N,N−2K,K+1]]q[[N,N-2K,K+1]]_q[[N,N−2K,K+1]]q​ under the following conditions: i) N=t(q−1)+1N=t(q-1)+1N=t(q−1)+1 or t(q−1)+2t(q-1)+2t(q−1)+2 with t∣(q+1)t|(q+1)t∣(q+1) and K=⌊t(q−1)+12t⌋+1K=\lfloor\frac{t(q-1)+1}{2t}\rfloor+1K=⌊2tt(q−1)+1​⌋+1; ii) (n−1)∣(q2−1)(n-1)|(q^2-1)(n−1)∣(q2−1), N=nN=nN=n or N=n+1N=n+1N=n+1, K0=⌊n+q−1q+1⌋K_0=\lfloor\frac{n+q-1}{q+1}\rfloorK0​=⌊q+1n+q−1​⌋, and K≥K0+1K\ge K_0+1K≥K0​+1; iii) N=tq+1N=tq+1N=tq+1, ∀ 1≤t≤q\forall~1\le t\le q∀ 1≤t≤q and K=⌊tq+q−1q+1⌋+1K=\lfloor\frac{tq+q-1}{q+1}\rfloor+1K=⌊q+1tq+q−1​⌋+1; iv) n∣(q2−1)n|(q^2-1)n∣(q2−1), n2=ngcd⁡(n,q+1)n_2=\frac{n}{\gcd (n,q+1)}n2​=gcd(n,q+1)n​, ∀ 1≤t≤q−1n2−1\forall~ 1\le t\le \frac{q-1}{n_2}-1∀ 1≤t≤n2​q−1​−1, N=(t+1)n+2N=(t+1)n+2N=(t+1)n+2 and K=⌊(t+1)n+1+q−1q+1⌋+1K=\lfloor \frac{(t+1)n+1+q-1}{q+1}\rfloor+1K=⌊q+1(t+1)n+1+q−1​⌋+1.
Self-Orthogonality of qqq-Ary Images of qmq^{m}qm-Ary Codes and Quantum Code Construction
A code over GF can be imaged or expanded into a code over GF using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems relating the properties of a code and its image with respect to a basis have been of great interest in the field of coding theory. In this work, a generalized version of the problem of self-orthogonality of the q-ary image of a qm-ary code has been considered. Given an inner product (more generally, a bi-additive form), necessary and sufficient conditions have been derived for a code over a field extension and an expansion basis so that an image of that code is self-orthogonal. The conditions require that the original code be self-orthogonal with respect to several related bi-additive forms whenever certain power sums of the dual basis elements do not vanish. Numerous interesting corollaries have been derived by specializing the general conditions. An interesting result for the canonical or regular inner product in fields of characteristic two is that only self-orthogonal codes result in self-orthogonal images. Another result is that image of a code is self-orthogonal for all bases if and only if trace of the code is self-orthogonal, except for the case of binary images of 4-ary codes. The conditions are particularly simple to state and apply for cyclic codes. To illustrate a possible application, new quantum error-correcting codes have been constructed with larger minimum distance than previously known.