Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels
Quantum Physics
2007-05-23 v1
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 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 on the error exponent.
Keywords
Cite
@article{arxiv.quant-ph/0007051,
title = {Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels},
author = {Pawel Wocjan and Dejan E. Lazic and Thomas Beth},
journal= {arXiv preprint arXiv:quant-ph/0007051},
year = {2007}
}