Abstract-- An outer bound to the discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as ...
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...
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....
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...
— 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...