arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.06602cs.ITmath.IT
收藏

两类新的量子MDS码

Two new classes of quantum MDS codes

Weijun Fang, Fang-Wei Fu

摘要:

设$p$为素数,$q$为$p$的幂。本文利用广义Reed-Solomon(简称GRS)码和扩展GRS码,构造了两类新的量子最大距离可分(MDS)码,其中参数\[ [[tq, tq-2d+2, d]]_{q} \](对于任意的$1 \leq t \leq q, 2 \leq d \leq \lfloor \frac{tq+q-1}{q+1}\rfloor+1$)和参数\[ [[t(q+1)+2, t(q+1)-2d+4, d]]_{q} \](对于任意的$1 \leq t \leq q-1, 2 \leq d \leq t+2$,参数$(p,t,d) \neq (2, q-1, q)$).我们的量子码具有灵活的参数,并且当$t > \frac{q}{2}$时具有大于$\frac{q}{2}+1$的最小距离。此外,我们的结构推广和改进了以前的一些结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑