Abstract
A conceptually simple method for derivation of lower bounds on the error exponent of specific families of block codes used on classical-quantum channels with arbitrary signal states over a finite dimensional Hilbert space is presented. It is shown that families of binary block codes with appropriately rescaled binomial multiplicity enumerators used on binary classical-quantum channels and decoded by the suboptimal decision rule introduced by Holevo attain the expurgated and cutoff rate lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.S. Holevo, Reliability function of general classical-quantum channel, LANL preprint no. quant-ph/9907087.
D. E. Lazic, V. Senk, A Direct Geometrical Method for Bounding the Error Exponent for Any Specific Family of Channel Codes — Part I: Cutoff Rate Lower Bound for Block Codes, IEEE Trans. Inform. Th., Vol. 38, No. 4, pp. 1548–1559, September 1992.
J. K. Omura, On general Gilbert bounds, IEEE Trans. Inform. Th., 15, pp. 661–665, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Wocjan, P., Lazic, D.E., Beth, T. (2002). Performances of Binary Block Codes Used on Binary Classical-Quantum Channels. In: Tombesi, P., Hirota, O. (eds) Quantum Communication, Computing, and Measurement 3. Springer, Boston, MA. https://doi.org/10.1007/0-306-47114-0_9
Download citation
DOI: https://doi.org/10.1007/0-306-47114-0_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-46609-0
Online ISBN: 978-0-306-47114-8
eBook Packages: Springer Book Archive