Exponent for classical-quantum multiple access channel
From MaRDI portal
Publication:6281798
arXiv1701.02939MaRDI QIDQ6281798
Author name not available (Why is that?)
Publication date: 11 January 2017
Abstract: In this paper we obtain a lower bound of exponent of average probability of error for classical quantum multiple access channel, which implies that for all rate pairs in the capacity region is achievable by a code with exponential probability of error. Thus we re-obtain the direct coding theorem.
This page was built for publication: Exponent for classical-quantum multiple access channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281798)