An Achievable Error Exponent for the Information Bottleneck Channel

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

14 Downloads (Pure)

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 languageEnglish
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024
PublisherInstitute of Electrical and Electronics Engineers
Pages1297-1302
Number of pages6
ISBN (Electronic)979-8-3503-8284-6
DOIs
Publication statusPublished - 19 Aug 2024
Event2024 IEEE International Symposium on Information Theory (ISIT) - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Conference

Conference2024 IEEE International Symposium on Information Theory (ISIT)
Country/TerritoryGreece
CityAthens
Period7/07/2412/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