English

Constructions of quantum MDS codes

Information Theory 2020-02-17 v1 math.IT

Abstract

Let Fq\mathbb{F}_q be a finite field with q=peq=p^{e} elements, where pp is a prime number and e1e \geq 1 is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum maximum-distance-separable ( quantum MDS) codes with parameters [[q+1,2kq1,qk+2]]q[[q + 1, 2k-q-1, q-k+2]]_q for q+22kq+1\lceil\frac{q+2}{2}\rceil \leq k\leq q+1, and [[n,2kn,nk+1]]q[[n,2k-n,n-k+1]]_q for nqn\leq q and n2kn \lceil\frac{n}{2}\rceil \leq k\leq n. Our constructions improve and generalize some results of available in the literature. Moreover, we give an affirmative answer to the open problem proposed by Fang et al. in \cite{Fang1}.

Keywords

Cite

@article{arxiv.2002.06040,
  title  = {Constructions of quantum MDS codes},
  author = {Hualu Liu and Xiusheng Liu},
  journal= {arXiv preprint arXiv:2002.06040},
  year   = {2020}
}

Comments

10 pages,2 tables

R2 v1 2026-06-23T13:41:58.440Z