Coding theorems for hybrid channels

From MaRDI portal
Publication:2877883

DOI10.1137/S0040585X97986527zbMATH Open1378.94016arXiv1408.3255OpenAlexW4234050342MaRDI QIDQ2877883FDOQ2877883


Authors: A. A. Kuznetsova, Alexander S. Holevo Edit this on Wikidata


Publication date: 27 August 2014

Published in: Theory of Probability and its Applications (Search for Journal in Brave)

Abstract: The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~cite{HCT}. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.


Full work available at URL: https://arxiv.org/abs/1408.3255




Recommendations





Cited In (7)





This page was built for publication: Coding theorems for hybrid channels

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