Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructions of quantum MDS codes

Published 14 Feb 2020 in cs.IT and math.IT | (2002.06040v1)

Abstract: Let Fq\mathbb{F}_q be a finite field with q=p<sup>eq=p<sup>{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}.

Authors (2)
Citations (15)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.