arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0511016quant-phcs.ITmath.IT
收藏

卷积和咬尾量子纠错码

Convolutional and tail-biting quantum error-correcting codes

G. David Forney,, Markus Grassl, Saikat Guha

摘要:

利用经典的自正交1/nF 4-线性卷积码和二进制线性卷积码,分别构造了具有4096个状态和最小距离为10的n-2/n无限制量子卷积码和CSS型量子卷积码作为稳定码.这些码通常具有比可比较的量子分组码或先前的量子卷积码更高的速率和更低的解码复杂度。速率-(n-2)/n块稳定器码具有相同的速率和纠错能力和基本上相同的解码算法,从这些卷积码通过咬尾。

英文摘要:

Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding algorithms are derived from these convolutional codes via tail-biting.

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

↑