This article is cited in 3 papers

Information Theory

A note on random coding bounds for classical-quantum channels

M. Dalai

Department of Information Engineering, University of Brescia, Brescia, Italy

Abstract: 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.

UDC: 621.391.1+519.2

Received: 14.03.2017
Revised: 10.04.2017

 English version: Problems of Information Transmission, 2017, 53:3, 222–228

Bibliographic databases:

• 
• 
•