Bernd Bandemer

Learn More
A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression. The utility of the inner bound is demonstrated by examples(More)
Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding scheme turns out to be the same as the Han-Kobayashi scheme for the two user-pair interference channel. This result is(More)
Multi user multiple-input multiple-output (MIMO) systems provide high capacity with the benefits of space division multiple access. The channel state information at the base station (BS) or access point (AP) is very important since it allows joint processing of all users’ signals which results in a significant performance improvement and increased data(More)
An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference-decoding inner bound is tight under certain strong interference conditions. The(More)
It is shown that simultaneous nonunique decoding is rate-optimal for the general K-sender, L-receiver discrete memoryless interference channel when encoding is restricted to randomly generated codebooks, superposition coding, and time sharing. This result implies that the Han-Kobayashi inner bound for the two-user-pair interference channel cannot be(More)
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region(More)
In this report, empirical models of the outdoor-to-indoor and indoor-to-indoor distributed channels are presented. In particular, the shadowing and fading statistics are extracted from experimental data at 2.45 GHz in stationary and mobile scenarios. Highlights of the paper include a separate model for static shadowing and largescale fading, a model for(More)
There are two variants of superposition coding schemes. Cover's original superposition coding scheme has code clouds of identical shape, while Bergmans's superposition coding scheme has code clouds of independently generated shapes. These two schemes yield identical achievable rate regions in several scenarios, such as the capacity region for degraded(More)
The index coding problem is a simple distributed source coding problem in which a sender broadcasts multiple messages to their respective receivers with side information about other messages. This problem arises in many applications such as content broadcasting, distributed caching, and wireless interference management. At the same time, it is a canonical(More)