Error Exponents for Oblivious Relaying and Connections to Source Coding with a Helper

TL;DR

This paper investigates error exponents in oblivious relaying, connecting it to source coding with a helper, and introduces new bounds and code constructions to improve understanding of the channel's reliability.

Contribution

It establishes an achievable error exponent for oblivious relaying, links it to the Wyner-Ahlswede-Körner problem, and extends code permutation techniques for better error performance.

Findings

Derived a new achievable error exponent for oblivious relaying.

Connected oblivious relaying to source coding with a helper, enabling code design insights.

Established a sphere packing upper bound for the error exponent.

Abstract

The information bottleneck channel, also known as oblivious relaying, is a two-hop channel where a transmitter sends messages to a remote receiver via an intermediate relay node. A codeword sent by the transmitter passes through a discrete memoryless channel to reach the relay, which then processes the noisy channel output and forwards it to the receiver through a noiseless rate-limited link. The relay is oblivious, in the sense that it has no knowledge of the channel codebook used in transmission. Previous works on oblivious relaying focus on characterizing achievable rates. In this work, we study error exponents and explore connections to lossless source coding with a helper, also known as the Wyner-Ahlswede-K\"orner (WAK) problem. We first establish an achievable error exponent for oblivious relaying under constant compositions codes. A key feature of our analysis is the use of the type covering lemma to design the relay's compress-forward scheme. We then show that employing constant composition code ensembles does not improve the rates achieved with their IID counterparts. We also derive a sphere packing upper bound for the error exponent. In the second part of this paper, we establish a connection between the information bottleneck channel and the WAK problem. We show that good codes for the latter can be produced through permuting codes designed for the former. This is accomplished by revisiting Ahlswede's covering lemma, and extending it to achieve simultaneous covering of a type class by several distinct sets using the same sequence of permutations. We then apply our approach to attain the best known achievable error exponent for the WAK problem, previously established by Kelly and Wagner. As a byproduct of our derivations, we also establish error exponents and achievable rates under mismatched decoding rules.