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

2000/07/17 by Pawel Wocjan, Wocjan, Pawel, Dejan E. Lazic +3
Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0007051

arxiv created 2000/07/17 · arxiv updated 2009/12/01

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.

Related

• Lower Bounds on Error Exponents via a New Quantum Decoder
• Exponent for classical-quantum multiple access channel
• Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem
• Error exponent of activated non-signaling assisted classical-quantum channel coding
• On the Error Exponent Distribution of Code Ensembles over Classical-Quantum Channels