The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k 3. We prove that superposition coding is indeed ...
We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. Characterizing the secrecy ca...
— We consider the fading broadcast channel from a secrecy point of view. In this channel, each user views the other user as an eavesdropper, and wants to keep its information 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...
A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves block-...