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:2308.00406 · Quantum Science and Technology

Near MDS and near quantum MDS codes via orthogonal arrays

Shanqi Pang, Chaomeng Zhang, Mengqian Chen, Miaomiao Zhang

Published Mar 12, 2024• 8 citations
arXivHTMLPDF

Abstract

Abstract Near maximum distance separable (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using symmetrical orthogonal arrays (OAs), we construct a lot of NMDS, m-MDS and almost extremal NMDS codes. Quantum error-correcting codes (QECCs) play a central role in quantum information processing and can protect quantum information from various quantum noises. We present a general method for constructing QECCs over mixed alphabets through asymmetrical OAs. Since quantum maximum distance separable (QMDS) codes over mixed alphabets with the dimension equal to one have not been found in all the literature so far, the definition of a near QMDS code over mixed alphabets is proposed. By using asymmetrical OAs, we obtain many such codes.

DOI
10.1088/2058-9565/ad332b

Related papers

$ m $-QMDS codes over mixed alphabets via orthogonal arrays

Mengqian Chen, Shanqi Pang, Rong Yan +1 more

The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (MDS) codes are optimal because the minimum distance cannot be improved for given length, dimension, and alphabet sizes. Quantum MDS codes over mixed alphabets are scarcely studied, and even the existence and construction of QECCs over mixed alphabets with a minimum distance of at least three remain an open question. In this paper, we define an $ m $-QMDS code over mixed alphabets, which is a generalization of quantum MDS (QMDS) codes. We establish a relation between such codes and asymmetric orthogonal arrays with orthogonal partitions. This relation is used for the construction of $ m $-QMDS codes with varying local dimension, length, and minimum distance. As applications of this method, numerous infinite families of $ m $-QMDS codes over mixed alphabets can be constructed explicitly. The constructed codes not only have more flexibility in the choice of parameters than other models but also possess better error correction capability and encoding efficiency.

arXiv:2406.10629•AIMS Mathematics•Jan 1, 2026•0 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

Some new classes of quantum convolutional and asymmetric MDS codes

Weiwei Wang, Jiantao Li

Recently, considerable works of literature have grown up around the theme of quantum error-correcting codes. Quantum convolutional maximum distance separable (MDS for brevity) codes and MDS asymmetric quantum codes often have better properties in long-distance quantum communications and asymmetric quantum channels. Within this writing, the authors utilized constacyclic codes in constructing three new kinds of MDS quantum convolutional codes and a class of MDS asymmetric quantum codes. These results are new in comparison with those presented in the existing publications on this subject.

International Conference on Modeling, Natural Language Processing and Machine Learning (CMNM)•May 17, 2024•0 citations

Quantum Error-Correcting Codes Based on Orthogonal Arrays

Rong Yan, Shanqi Pang, Mengqian Chen +1 more

In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N,1,d+1))s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3,s,2))s for all si≥3, ((4,s2,2))s for all si≥5, ((5,s,3))s for all si≥4, ((6,s2,3))s for all si≥5, ((7,s3,3))s for all si≥7, ((8,s2,4))s for all si≥9, ((9,s3,4))s for all si≥11, ((9,s,5))s for all si≥9, ((10,s2,5))s for all si≥11, ((11,s,6))s for all si≥11, and ((12,s2,6))s for all si≥13, where s=s1⋯sn and s1,…,sn are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets.

Entropy•Apr 19, 2023•4 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

On quantum MDS codes

Martin Rötteler, Markus Grassl, T. Beth

We construct maximum distance separable quantum error-correcting codes. The codes are defined over q-dimensional quantum systems, where q is any prime power. The construction yields quantum MDS codes of length up to q+1 for all possible dimensions and some quantum MDS codes of length up to q2+1. In particular, those families contain codes [[6,2,3]]pand [[7,3,3]]pfor pges3 (cf. [K. Feng (2002)])

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•53 citations
Abstract Near maximum distance separable (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using symmetrical orthogonal arrays (OAs), we construct a lot of NMDS, m-MDS and almost extremal NMDS codes. Quantum error-correcting codes (QECCs) play a central role in quantum information processing and can protect quantum information from various quantum noises. We present a general method for constructing QECCs over mixed alphabets through asymmetrical OAs. Since quantum maximum distance separable (QMDS) codes over mixed alphabets with the dimension equal to one have not been found in all the literature so far, the definition of a near QMDS code over mixed alphabets is proposed. By using asymmetrical OAs, we obtain many such codes.
The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (MDS) codes are optimal because the minimum distance cannot be improved for given length, dimension, and alphabet sizes. Quantum MDS codes over mixed alphabets are scarcely studied, and even the existence and construction of QECCs over mixed alphabets with a minimum distance of at least three remain an open question. In this paper, we define an $ m $-QMDS code over mixed alphabets, which is a generalization of quantum MDS (QMDS) codes. We establish a relation between such codes and asymmetric orthogonal arrays with orthogonal partitions. This relation is used for the construction of $ m $-QMDS codes with varying local dimension, length, and minimum distance. As applications of this method, numerous infinite families of $ m $-QMDS codes over mixed alphabets can be constructed explicitly. The constructed codes not only have more flexibility in the choice of parameters than other models but also possess better error correction capability and encoding efficiency.
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.
Recently, considerable works of literature have grown up around the theme of quantum error-correcting codes. Quantum convolutional maximum distance separable (MDS for brevity) codes and MDS asymmetric quantum codes often have better properties in long-distance quantum communications and asymmetric quantum channels. Within this writing, the authors utilized constacyclic codes in constructing three new kinds of MDS quantum convolutional codes and a class of MDS asymmetric quantum codes. These results are new in comparison with those presented in the existing publications on this subject.
In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N,1,d+1))s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3,s,2))s for all si≥3, ((4,s2,2))s for all si≥5, ((5,s,3))s for all si≥4, ((6,s2,3))s for all si≥5, ((7,s3,3))s for all si≥7, ((8,s2,4))s for all si≥9, ((9,s3,4))s for all si≥11, ((9,s,5))s for all si≥9, ((10,s2,5))s for all si≥11, ((11,s,6))s for all si≥11, and ((12,s2,6))s for all si≥13, where s=s1⋯sn and s1,…,sn are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets.
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.