Abstract

Let Fq\mathbb{F}_q be a finite field with q=peq=p^{e} elements, where pp is a prime number and e≥1e \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,2k−q−1,q−k+2]]q[[q + 1, 2k-q-1, q-k+2]]_q for ⌈q+22⌉≤k≤q+1\lceil\frac{q+2}{2}\rceil \leq k\leq q+1, and [[n,2k−n,n−k+1]]q[[n,2k-n,n-k+1]]_q for n≤qn\leq q and ⌈n2⌉≤k≤n \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}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.