Papers
Topics
Authors
Recent
Search
2000 character limit reached

Two new classes of quantum MDS codes

Published 18 Mar 2018 in cs.IT and math.IT | (1803.06602v2)

Abstract: Let pp be a prime and let qq be a power of pp. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters [ [[tq, tq-2d+2, d]]{q} ] for any 1≤t≤q,2≤d≤⌊tq+q−1q+1⌋+11 \leq t \leq q, 2 \leq d \leq \lfloor \frac{tq+q-1}{q+1}\rfloor+1, and [ [[t(q+1)+2, t(q+1)-2d+4, d]]{q} ] for any 1≤t≤q−1,2≤d≤t+21 \leq t \leq q-1, 2 \leq d \leq t+2 with (p,t,d)≠(2,q−1,q)(p,t,d) \neq (2, q-1, q). Our quantum codes have flexible parameters, and have minimum distances larger than q2+1\frac{q}{2}+1 when $t > \frac{q}{2}$. Furthermore, it turns out that our constructions generalize and improve some previous results.

Authors (2)
Citations (63)

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.