We consider the Gaussian multi-antenna compound broadcast channel where one transmitter transmits several messages, each intended for a different user whose channel realization is arbitrarily chosen from a finite set. Our investigation focuses on the behavior of this channel at high SNRs and we obtain the multiplexing gain of the sum capacity for a number of cases, and point out some implicatio...

In the absence of accurate channel probability distribution information or in broadcast scenarios, code design for consistent channel-by-channel performance, rather than average performance, may be desirable. Root and Varaiya’s compound channel theorem promises the existence of universal codes that operate with a consistent proximity to channel mutual information on any instance of the compound...

A compound exponential-server timing channel consists of a number of infinite-buffer single-server queues in tandem. The message is coded in the sequence of arrival times to the first queue. We consider the performance of a structurally simple mismatch decoder that is the maximumlikelihood decoder for a single queue.

Compound authentication protocols, such as EAP in IKEv2 or SASL over TLS, bind application-level authentication to a transport-level authenticated channel in order to obtain strong composite authentication under weak trust assumptions. Despite their wide deployment, these protocols remain poorly understood, leading to several credential forwarding man-in-themiddle attacks. We present formal mod...