Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is a preliminary version. A short version of this paper has been submitted to ISIT2012. An extended version is in prepara

Scientific paper

In this paper, the sphere packing bound of Fano, Shannon, Gallager and Berlekamp and the zero-rate bound of Berlekamp are extended to general classical-quantum channels. The upper bound for the reliability function obtained from the sphere packing coincides at high rates, for the case of pure state channels, with a lower bound derived by Burnashev and Holevo. Thus, for pure state channels, the reliability function at high rates is now exactly determined. For the general case, the obtained upper bound expression at high rates was conjectured to represent also a lower bound to the reliability function, but a complete proof has not been obtained yet. Finally, the obtained zero-rate upper bound to the reliability function of a general classical-quantum channel with no zero-error capacity coincides with a lower bound obtained by Holevo, thus determining the exact expression.

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

Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels 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 Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-444759

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