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

Quantum Information and Computation

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

Xianmang He

Published Mar 1, 2018• 2 citations
Publisher

Abstract

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.

DOI
10.26421/qic18.3-4-3

Related papers

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•59 citations

Some quantum MDS codes from GRS codes

Guohui Wang, Chunming Tang

The construction of quantum maximum-distance-separable (MDS) codes has become one of the major goals in quantum coding theory. In this paper, we construct several classes of Hermitian self-orthogonal generalized Reed–Solomon codes. Based on these classical MDS codes, we obtain several new classes of quantum MDS codes with large minimum distance. It turns out that these constructed quantum MDS codes have fewer constraints on the selection of code length, and in some cases, have larger minimum distance than previous literature. Notably, some of the distance parameters of our codes are greater than (q/2)+1.

Linear and Multilinear Algebra•Feb 25, 2023•4 citations

Constacyclic Codes and Some New Quantum MDS Codes

Xiaoshan Kai, Shixin Zhu, Li Ping

One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. Quantum maximal distance separable (MDS) codes are optimal in the sense they attain maximal minimum distance. Recently, constructing quantum MDS codes has received much attention and seems to become more and more difficult. In this paper, based on classical constacyclic codes, we construct some new quantum MDS codes by employing the Hermitian construction. Compared with the known quantum MDS codes, these quantum MDS codes have much larger minimum distance.

IEEE Transactions on Information Theory•Feb 25, 2014•212 citations

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

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 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•4 citations
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.
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.
The construction of quantum maximum-distance-separable (MDS) codes has become one of the major goals in quantum coding theory. In this paper, we construct several classes of Hermitian self-orthogonal generalized Reed–Solomon codes. Based on these classical MDS codes, we obtain several new classes of quantum MDS codes with large minimum distance. It turns out that these constructed quantum MDS codes have fewer constraints on the selection of code length, and in some cases, have larger minimum distance than previous literature. Notably, some of the distance parameters of our codes are greater than (q/2)+1.
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. Quantum maximal distance separable (MDS) codes are optimal in the sense they attain maximal minimum distance. Recently, constructing quantum MDS codes has received much attention and seems to become more and more difficult. In this paper, based on classical constacyclic codes, we construct some new quantum MDS codes by employing the Hermitian construction. Compared with the known quantum MDS codes, these quantum MDS codes have much larger minimum distance.
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.
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.