skip to content
 

Reliability of classical and classical-quantum channels

Presented by: 
M Dalai Università degli Studi di Brescia
Date: 
Friday 18th October 2013 - 14:00 to 15:00
Venue: 
INI Seminar Room 1
Abstract: 
The performance of a channel is usually measured in terms of its capacity C, intended as the largest rate achievable by block codes with probability of error which vanishes in the block-length. For rates R<C, the probability of error for optimal codes decreases exponentially fast with the block-length, and a more detailed measure of the performance of the channel is the so called reliability function E(R), the first order exponent of this error.Determining E(R) exactly is an unsolved problem in general; it includes as a sub-problem, for example, the determination of the zero-error capacity (also called Shannon capacity of a graph). In this talk, we discuss bounds to E(R) for classical and classical-quantum channels and presents some connections between those bounds and the Lovasz theta function.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons