Abstract
We derive an achievable error exponent for the information bottleneck channel. The exponent is expressed as a minimum of two terms: a compression error exponent due to the bottleneck, and a channel decoding error exponent. Achievability is established through treating the rate-limited noiseless link between the relay and the receiver asymptotically as a virtual discrete memoryless channel.
| Original language | English |
|---|---|
| Title of host publication | 2024 IEEE International Symposium on Information Theory, ISIT 2024 |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 1297-1302 |
| Number of pages | 6 |
| ISBN (Electronic) | 979-8-3503-8284-6 |
| DOIs | |
| Publication status | Published - 19 Aug 2024 |
| Event | 2024 IEEE International Symposium on Information Theory (ISIT) - Athens, Greece Duration: 7 Jul 2024 → 12 Jul 2024 |
Conference
| Conference | 2024 IEEE International Symposium on Information Theory (ISIT) |
|---|---|
| Country/Territory | Greece |
| City | Athens |
| Period | 7/07/24 → 12/07/24 |
Fingerprint
Dive into the research topics of 'An Achievable Error Exponent for the Information Bottleneck Channel'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver