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

Mathematics in Computer Science

A Different Construction for Some Classes of Quantum MDS Codes

Mustafa Sarı, Emre Kolotoğlu

Published Nov 8, 2019• 3 citations
Publisher
DOI
10.1007/s11786-019-00418-3

Related papers

A Class of New Quantum MDS Codes from Constacyclic Codes

娜 黄

Pure Mathematics•Jan 1, 2018•1 citation

Constructions of Six Classes of Entanglement-Assisted Quantum MDS Codes

琳雪 张

Pure Mathematics•Jan 1, 2019•0 citations

Constructions of new entanglement-assisted quantum MDS and almost MDS codes

Jianfa Qian, Lina Zhang

Quantum Information Processing•Jan 28, 2019•49 citations

Some constructions of quantum MDS codes

Simeon Ball

arXiv:1907.04391•Designs Codes and Cryptography•Feb 23, 2021•44 citations

Quantum MDS Codes with length $n\equiv 0,1($mod$\,\frac{q\pm1}{2})$

Ruhao Wan

An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition, the length $n$ of most of the quantum MDS codes we constructed satisfies $n\equiv 0,1($mod$\,\frac{q\pm1}{2})$, which is different from previously known code lengths. At the same time, the quantum MDS codes we construct have large minimum distances that are greater than $q/2+1$.

arXiv:2310.00214•Sep 30, 2023•0 citations

Construction of some new quantum MDS codes

Xueying Shi, Qin Yue, Xiaomeng Zhu

Finite Fields and Their Applications•May 23, 2017•61 citations
Quantum MDS Codes with length n≡0,1(n\equiv 0,1(n≡0,1(mod q±12)\,\frac{q\pm1}{2})2q±1​)
An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition, the length nnn of most of the quantum MDS codes we constructed satisfies n≡0,1(n\equiv 0,1(n≡0,1(mod q±12)\,\frac{q\pm1}{2})2q±1​), which is different from previously known code lengths. At the same time, the quantum MDS codes we construct have large minimum distances that are greater than q/2+1q/2+1q/2+1.