Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels

Simple item page
dc.creatorWocjan, Pawel
dc.creatorLazic, Dejan E.
dc.creatorBeth, Thomas
dc.date2000-07-17
dc.date.accessioned2026-07-07T06:00:25Z
dc.date.available2026-07-07T06:00:25Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/quant-ph/0007051
dc.identifierhttp://arxiv.org/abs/quant-ph/0007051
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88968
dc.subjectQuantum Physics
dc.titlePerformances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels
dc.typetext

Files

Collections

arXiv