An Achievable Error Exponent for the Information Bottleneck Channel

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.