Reliability of classical and classical-quantum channels
1 hour 18 mins,
1.11 GB,
MPEG-4 Video
640x360,
29.97 fps,
44100 Hz,
1.93 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Dalai, M (Università degli Studi di Brescia)
Friday 18 October 2013, 14:00-15:00 |
|---|
| Created: | 2013-10-22 09:43 |
|---|---|
| Collection: | Mathematical Challenges in Quantum Information |
| Publisher: | Isaac Newton Institute |
| Copyright: | Dalai, M |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 640x360 | 1.93 Mbits/sec | 1.11 GB | View | Download | |
| WebM | 640x360 | 772.15 kbits/sec | 441.13 MB | View | Download | |
| iPod Video | 480x270 | 522.36 kbits/sec | 298.42 MB | View | Download | |
| MP3 | 44100 Hz | 250.15 kbits/sec | 142.91 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||