pith. sign in

arxiv: 1803.06602 · v2 · pith:JZ35DG37new · submitted 2018-03-18 · 💻 cs.IT · math.IT

Two new classes of quantum MDS codes

classification 💻 cs.IT math.IT
keywords codesfracquantumclassesparametersconstructconstructionsdistances
0
0 comments X
read the original 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 \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 \leq t \leq q-1, 2 \leq d \leq t+2$ with $(p,t,d) \neq (2, q-1, q)$. Our quantum codes have flexible parameters, and have minimum distances larger than $\frac{q}{2}+1$ when $t > \frac{q}{2}$. Furthermore, it turns out that our constructions generalize and improve some previous results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.