Several Classes of Concatenated Quantum Codes: Constructions and Bounds

Simple item page
dc.creatorFujita, Hachiro
dc.date2006-08-08
dc.date.accessioned2026-07-07T07:26:25Z
dc.date.available2026-07-07T07:26:25Z
dc.descriptionIn 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.
dc.descriptionThis paper was presented in part at the IEICE Technical Meeting on Information Theory, Nagoya, Japan, March 2006
dc.identifierhttps://arxiv.org/abs/quant-ph/0608063
dc.identifierhttp://arxiv.org/abs/quant-ph/0608063
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117069
dc.subjectQuantum Physics
dc.titleSeveral Classes of Concatenated Quantum Codes: Constructions and Bounds
dc.typetext

Files

Collections

arXiv