3 citations · 4 across the 4 of their papers we have counts for
6 papers · 1 filter
The Compound Information Bottleneck Outlook
Michael Dikshtein, Nir Weinberger, Shlomo Shamai
We formulate and analyze the compound information bottleneck programming. In this problem, a Markov chain is assumed wi…
Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations
Michael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai
A diamond network is considered in which the central processor is connected, via backhaul noiseless links, to multiple conferencing base stations, which communicate with a single u…
A Class of Nonbinary Symmetric Information Bottleneck Problems
Michael Dikshtein, Shlomo Shamai
We study two dual settings of information processing. Let be a Markov chain with fixed joint probability mass function…
Broadcasting Information subject to State Masking over a MIMO State Dependent Gaussian Channel
Michael Dikshtein, Anelia Somekh-Baruch, Shlomo Shamai
The problem of channel coding over the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) with additive independent Gaussian states is considered. The states are…
Broadcasting Information subject to State Masking
Michael Dikshtein, Shlomo Shamai
We study the problem of coding over a general discrete memoryless broadcast channel controlled by random parameters. The parameters are available at the transmitter in a non-causal…
Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper
Michael Dikshtein, Ruchen Duan, Yingbin Liang +1
We consider a state-dependent parallel Gaussian channel with independent states and a common cognitive helper, in which two transmitters wish to send independent information to the…