A Note on Random Coding Bounds for Classical-Quantum Channels

作者:Dalai M*
来源:Problems of Information Transmission, 2017, 53(3): 222-228.
DOI:10.1134/S0032946017030036

摘要

A modified derivation of achievability results in classical-quantum channel coding theory is proposed, which has, in our opinion, two main benefits over previously used methods: it allows to (i) follow in a simple and clear way how binary hypothesis testing relates to channel coding achievability results, and (ii) derive in a unified way all previously known random coding achievability bounds on error exponents for classical and classical-quantum channels.

  • 出版日期2017-7

全文