Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is du...
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...
A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a...
An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known....
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
Abstract-- The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Two classes of channels are considered: weak and mixed Gaussian IC. For the weak Gauss...
In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not...
Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Rez...
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
— In this work a relay channel with a wire-tapper is studied for both discrete memoryless and Gaussian channels. The wire-tapper receives a physically degraded version of the des...