Several Classes of Concatenated Quantum Codes: Constructions and Bounds

Details Several Classes of Concatenated Quantum Codes: Constructions and Bounds Several Classes of Concatenated Quantum Codes: Constructions and Bounds

2006-08-08

arxiv.org/abs/quant-ph/0608063v1

Physics

Quantum Physics

This paper was presented in part at the IEICE Technical Meeting on Information Theory, Nagoya, Japan, March 2006

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Several Classes of Concatenated Quantum Codes: Constructions and Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Several Classes of Concatenated Quantum Codes: Constructions and Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Several Classes of Concatenated Quantum Codes: Constructions and Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247919