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

New $q$-ary Quantum MDS Codes with Distances Bigger than $\frac{q}{2}$

Xianmang He, Xu, Liqing, Hao Chen

Published Jul 30, 2015• 0 citations
arXivHTMLPDF

Abstract

Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there are only few $q$-ary quantum MDS $[[n,n-2d+2,d]]_q$ codes with minimum distances $d>\frac{q}{2}$ for sparse lengths $n>q+1$. In the case $n=\frac{q^2-1}{m}$ where $m|q+1$ or $m|q-1$ there are complete results. In the case $n=\frac{q^2-1}{m}$ where $m|q^2-1$ is not a factor of $q-1$ or $q+1$, there is no $q$-ary quantum MDS code with $d> \frac{q}{2}$ has been constructed. In this paper we propose a direct approch to construct Hermitian self-orthogonal codes over ${\bf F}_{q^2}$. Thus we give some new $q$-ary quantum codes in this case. Moreover we present many new $q$-ary quantum MDS codes with lengths of the form $\frac{w(q^2-1)}{u}$ and minimum distances $d > \frac{q}{2}$.

DOI
10.48550/arxiv.1507.08355

Related papers

A Construction of New Quantum MDS Codes

Lingfei Jin, Chaoping Xing

It has been a great challenge to construct new quantum maximum-distance-separable (MDS) codes. In particular, it is very hard to construct the quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known q-ary quantum MDS codes have minimum distance ≤q/2 + 1. In this paper, we provide a construction of the quantum MDS codes with minimum distance >q/2 + 1. In particular, we show the existence of the q-ary quantum MDS codes with length n = q2+ 1 and minimum distance d for any d q + 1 (this result extends those given in the works of Guardia (2011), Jin et al. (2010), and Kai an Zhu (2012)); and with length (q2+ 2)/3 and minimum distance d for any d (2q+2)/3 if 3|(q + 1). Our method is through Hermitian selforthogonal codes. The main idea of constructing the Hermitian self-orthogonal codes is based on the solvability in Fqof a system of homogenous equations over Fq2.

arXiv:1311.3009•IEEE Transactions on Information Theory•Jan 31, 2014•108 citations

Some New Constructions of Quantum MDS Codes

Weijun Fang, Fang‐Wei Fu

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of$q$-ary quantum MDS codes by using generalized Reed–Solomon (GRS) codes and Hermitian construction. The minimum distances of our quantum MDS codes can be larger than$\frac {q}{2}+1$. Three of these six classes of quantum MDS codes have longer lengths than the ones constructed in[1]and[2], hence some of their results can be easily derived from ours via the propagation rule. Moreover, some known quantum MDS codes of specific lengths can be seen as special cases of ours and the minimum distances of some known quantum MDS codes are also improved as well.

arXiv:1804.08213•IEEE Transactions on Information Theory•Sep 3, 2019•58 citations

New Quantum MDS codes from Hermitian self-orthogonal generalized Reed-Solomon codes

Ruhao Wan, Shixin Zhu

Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary quantum MDS codes with minimum distance larger than $q/2+1$. Furthermore, the parameters of our quantum MDS code cannot be obtained from the previous constructions.

arXiv:2302.06169•Feb 13, 2023•0 citations

Construction of New q-ary quantum MDS codes with distance greater than $\frac{q}{2}$

Yu SHAO, Yindong Chen, Jingli WANG +1 more

In the past decade, the construction of quantum maximum-distance separable (MDS) codes has been extensively and deeply explored. For lengths of the form $n=\frac{q^2-1}{m}$, where m is an integer such that m|q+1 or m|q-1, comprehensive results are available. In this paper, we investigate the case where the length $n=\frac{q^2-1}{m}$, yet m is neither a divisor of q-1 nor q+1. Ultimately, this problem can be reduced to identifying the necessary and sufficient conditions for the existence of pairs (m1, m2), where $m=\frac{m_1\cdot m_2}{m_1+m_2-1}$ is an integer. In addition, the greatest common divisor of m with both m1 and m2, denoted as gcd(m, m1) and gcd(m, m2), must be greater than 1. The quantum MDS codes presented in this paper have not been previously investigated and their minimum distances exceed $\frac{q}{2}$.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2026•0 citations

Constructing new q-ary quantum MDS codes with distances bigger than q/2 from generator matrices

Xianmang He

The construction of quantum error-correcting codes has been an active field of quantum information theory since the publication of \cite{Shor1995Scheme,Steane1998Enlargement,Laflamme1996Perfect}. It is becoming more and more difficult to construct some new quantum MDS codes with large minimum distance. In this paper, based on the approach developed in the paper \cite{NewHeMDS2016}, we construct several new classes of quantum MDS codes. The quantum MDS codes exhibited here have not been constructed before and the distance parameters are bigger than q/2.

Quantum Information and Computation•Mar 1, 2018•2 citations

Two new classes of quantum MDS codes from generalized Reed-Solomon codes

Weiwei Wang, Jiantao Li

In this paper, we mainly use classical Hermitian self-orthogonal generalized Reed-Solomon codes to construct two new classes of quantum MDS codes. Most of our quantum MDS codes have minimum distance larger than q/2+1. Compared with previously known constructions, these quantum MDS codes in our constructions have large minimum distance and their parameters are not covered by the previous codes.

arXiv:2001.03445•Jan 6, 2020•0 citations
New qqq-ary Quantum MDS Codes with Distances Bigger than q2\frac{q}{2}2q​
Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there are only few qqq-ary quantum MDS [[n,n−2d+2,d]]q[[n,n-2d+2,d]]_q[[n,n−2d+2,d]]q​ codes with minimum distances d>q2d>\frac{q}{2}d>2q​ for sparse lengths n>q+1n>q+1n>q+1. In the case n=q2−1mn=\frac{q^2-1}{m}n=mq2−1​ where m∣q+1m|q+1m∣q+1 or m∣q−1m|q-1m∣q−1 there are complete results. In the case n=q2−1mn=\frac{q^2-1}{m}n=mq2−1​ where m∣q2−1m|q^2-1m∣q2−1 is not a factor of q−1q-1q−1 or q+1q+1q+1, there is no qqq-ary quantum MDS code with d>q2d> \frac{q}{2}d>2q​ has been constructed. In this paper we propose a direct approch to construct Hermitian self-orthogonal codes over Fq2{\bf F}_{q^2}Fq2​. Thus we give some new qqq-ary quantum codes in this case. Moreover we present many new qqq-ary quantum MDS codes with lengths of the form w(q2−1)u\frac{w(q^2-1)}{u}uw(q2−1)​ and minimum distances d>q2d > \frac{q}{2}d>2q​.
It has been a great challenge to construct new quantum maximum-distance-separable (MDS) codes. In particular, it is very hard to construct the quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known q-ary quantum MDS codes have minimum distance ≤q/2 + 1. In this paper, we provide a construction of the quantum MDS codes with minimum distance >q/2 + 1. In particular, we show the existence of the q-ary quantum MDS codes with length n = q2+ 1 and minimum distance d for any d q + 1 (this result extends those given in the works of Guardia (2011), Jin et al. (2010), and Kai an Zhu (2012)); and with length (q2+ 2)/3 and minimum distance d for any d (2q+2)/3 if 3|(q + 1). Our method is through Hermitian selforthogonal codes. The main idea of constructing the Hermitian self-orthogonal codes is based on the solvability in Fqof a system of homogenous equations over Fq2.
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes ofqqq-ary quantum MDS codes by using generalized Reed–Solomon (GRS) codes and Hermitian construction. The minimum distances of our quantum MDS codes can be larger thanq2+1\frac {q}{2}+12q​+1. Three of these six classes of quantum MDS codes have longer lengths than the ones constructed in[1]and[2], hence some of their results can be easily derived from ours via the propagation rule. Moreover, some known quantum MDS codes of specific lengths can be seen as special cases of ours and the minimum distances of some known quantum MDS codes are also improved as well.
Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of qqq-ary quantum MDS codes with minimum distance larger than q/2+1q/2+1q/2+1. Furthermore, the parameters of our quantum MDS code cannot be obtained from the previous constructions.
Construction of New q-ary quantum MDS codes with distance greater than q2\frac{q}{2}2q​
In the past decade, the construction of quantum maximum-distance separable (MDS) codes has been extensively and deeply explored. For lengths of the form n=q2−1mn=\frac{q^2-1}{m}n=mq2−1​, where m is an integer such that m|q+1 or m|q-1, comprehensive results are available. In this paper, we investigate the case where the length n=q2−1mn=\frac{q^2-1}{m}n=mq2−1​, yet m is neither a divisor of q-1 nor q+1. Ultimately, this problem can be reduced to identifying the necessary and sufficient conditions for the existence of pairs (m1, m2), where m=m1⋅m2m1+m2−1m=\frac{m_1\cdot m_2}{m_1+m_2-1}m=m1​+m2​−1m1​⋅m2​​ is an integer. In addition, the greatest common divisor of m with both m1 and m2, denoted as gcd(m, m1) and gcd(m, m2), must be greater than 1. The quantum MDS codes presented in this paper have not been previously investigated and their minimum distances exceed q2\frac{q}{2}2q​.
The construction of quantum error-correcting codes has been an active field of quantum information theory since the publication of \cite{Shor1995Scheme,Steane1998Enlargement,Laflamme1996Perfect}. It is becoming more and more difficult to construct some new quantum MDS codes with large minimum distance. In this paper, based on the approach developed in the paper \cite{NewHeMDS2016}, we construct several new classes of quantum MDS codes. The quantum MDS codes exhibited here have not been constructed before and the distance parameters are bigger than q/2.