Advertisement

Performances of Binary Block Codes Used on Binary Classical-Quantum Channels

Binary block codes attaining the expurgated and cutoff rate lower bound on the error exponent
  • Pawel Wocjan
  • Dejan E. Lazic
  • Thomas Beth

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.

Keywords

Classical-quantum channels binary block codes error exponent 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.S. Holevo, Reliability function of general classical-quantum channel, LANL preprint no. quant-ph/9907087.Google Scholar
  2. [2]
    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.MathSciNetGoogle Scholar
  3. [3]
    J. K. Omura, On general Gilbert bounds, IEEE Trans. Inform. Th., 15, pp. 661–665, 1973.MathSciNetGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Pawel Wocjan
    • 1
  • Dejan E. Lazic
    • 1
  • Thomas Beth
    • 1
  1. 1.Institut für Algorithmen und Kognitive SystemeKarlsruheGermany

Personalised recommendations