Several Classes of Concatenated Quantum Codes: Constructions and Bounds
Quantum Physics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.quant-ph/0608063,
title = {Several Classes of Concatenated Quantum Codes: Constructions and Bounds},
author = {Hachiro Fujita},
journal= {arXiv preprint arXiv:quant-ph/0608063},
year = {2007}
}
Comments
This paper was presented in part at the IEICE Technical Meeting on Information Theory, Nagoya, Japan, March 2006