Sphere-Packing Bound for Symmetric Classical-Quantum Channels

Author name not available (Why is that?)

Publication date: 11 January 2017

Abstract: We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial. The established pre-factor is essentially optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function.

This page was built for publication: Sphere-Packing Bound for Symmetric Classical-Quantum Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281800)