Computer Science – Information Theory
Scientific paper
2008-05-28
Computer Science
Information Theory
27 pages, 1 figure, submitted to IEEE Transaction on Information Theory
Scientific paper
In this paper, we study capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured by equivocation. We propose both inner and outer bounds to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csisz\'{a}r and K\"{o}rner's rate equivocation region for broadcast channels with a single confidential message, Liu {\em et al}'s achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand and Pinsker's achievable rate region for general broadcast channels. Our proposed outer bounds, together with the inner bound, helps establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including less noisy, deterministic, and semi-deterministic channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.
Cao Yi
Chen Biao
Xu Jin
No associations
LandOfFree
Capacity Bounds for Broadcast Channels with Confidential Messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Capacity Bounds for Broadcast Channels with Confidential Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity Bounds for Broadcast Channels with Confidential Messages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-416644