Performances of Binary Block Codes Used on Binary Classical-Quantum Channels
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.
KeywordsClassical-quantum channels binary block codes error exponent
Unable to display preview. Download preview PDF.
- A.S. Holevo, Reliability function of general classical-quantum channel, LANL preprint no. quant-ph/9907087.Google Scholar