Referenced Items are not available for this document.
A lower bound on the probability of decoding error for a quantum communication channel is presented, from which the strong converse to the quantum channel coding theorem is immediately shown. The results and their derivations are mostly straightforward extensions of the classical counterparts which were established by Arimoto (1973), except that more careful treatment is necessary here due to the noncommutativity of operators
Published in:
Information Theory, IEEE Transactions on
(Volume:45
,
Issue:
7
)
Date of Publication: Nov 1999
- Page(s):
- 2486 - 2489
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 6418567
- Digital Object Identifier :
- 10.1109/18.796386
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Nov 1999
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
