Two new classes of quantum MDS codes

Abstract

Let p be a prime and let q be a power of p. 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+1, and \[ [[t(q+1)+2, t(q+1)-2d+4, d]]q \] for any 1 ≤ t ≤ q-1, 2 ≤ d ≤ t+2 with (p,t,d) ≠ (2, q-1, q). Our quantum codes have flexible parameters, and have minimum distances larger than q2+1 when t > q2. Furthermore, it turns out that our constructions generalize and improve some previous results.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…