Krawtchouk多项式与纯的加性量子纠错码的上界

doi:10.3724/SP.J.1146.2006.00304

Download: PDF (202 KB)
Export: BibTeX | EndNote (RIS)

Abstract Two universal bounds for pure additive quantum error correcting codes are obtained by using of Krawtchouk polynomials, and it is proved that the quantum Singleton bound and the asymptotic quantum Hamming bound are just the special cases of those two universal bounds.

Key words： Krawtchouk polynomials Additive quantum error correcting codes Quantum Singleton bound Asymptotic quantum Hamming bound

Received: 17 March 2006

PACS:

TN911.22

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors

	Ma Yue-fei

Cite this article:

Ma Yue-fei. Krawtchouk Polynomials and Upper Bounds for Pure Additive Quantum Error Correcting Codes[J]. , 2007, 29(9): 2146-2148 .

URL:

http://jeit.ie.ac.cn/EN/10.3724/SP.J.1146.2006.00304 OR http://jeit.ie.ac.cn/EN/Y2007/V29/I9/2146

[1]	Wang Juan, Wang Ping. An Adaptive Reed-Solomon Iterative Correction Method Based on Data Layer-wise Decomposition and Its Application[J]. , 2015, 37(5): 1173-1179.