On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding

This work investigates the general two-user compound Broadcast Channel (BC) in which an encoder wishes to transmit two private messages W1 and W2 to two receivers while being oblivious to the actual channel realizations controlling the communication. The focus is on the characterization of the largest achievable rate region by resorting to more involved encoding and decoding techniques than the usual coding schemes of the standard BC. Involved decoding schemes are first explored, and an achievable rate region is derived based on the principle of Interference Decoding (ID), in which each receiver decodes its intended message and chooses to (non-uniquely) decode, or not, the interfering non-itended message. This decoding scheme is shown to be capacity achieving for a class of non-trivial compound BEC/BSC broadcast channels while the worst-case of Marton's inner bound-based on No Interference Decoding (NID)-fails to achieve the capacity region. Involved encoding schemes are later investigated, and an achievable rate region is derived based on Multiple Description (MD) coding wherin the encoder transmits a common description as well as multiple dedicated private descriptions to the many possible channel realizations of the users. It turns out that MD coding yields larger inner bounds than the single description scheme-Common Description (CD) coding-for a class of compound Multiple Input Single Output Broadcast Channels (MISO BC).