Several Classes of Concatenated Quantum Codes: Constructions and Bounds

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-247919

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.