arXiv:quant-ph/0608063AbstractReferencesReviewsResources
Several Classes of Concatenated Quantum Codes: Constructions and Bounds
Published 2006-08-08Version 1
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of Ashikhmin--Litsyn--Tsfasman and Matsumoto. We also give a polynomial-time decoding algorithm for the codes that can decode up to one fourth of the lower bound on the minimum distance of the codes.
Comments: This paper was presented in part at the IEICE Technical Meeting on Information Theory, Nagoya, Japan, March 2006
Categories: quant-ph
Related articles: Most relevant | Search more
Exact and Approximate Performance of Concatenated Quantum Codes
arXiv:quant-ph/9608012 (Published 1996-08-08)
Concatenated Quantum Codes
arXiv:quant-ph/0206061 (Published 2002-06-11)
Exact Performance of Concatenated Quantum Codes