On a special class of broadcast channels with confidential messages

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

It is shown that Csiszár and Körner's characterization of a discrete memoryless channel (DMC) X → Y as being less noisy than the DMC X → Z is equivalent to the condition that the mutual-information difference I(X; Y) -I(X; Z) be a convex-∩ function of the probability distribution for X. This result is used to obtain a simple determination of the capacity region of the broadcast channel with confidential messages (BCC), which is a DMC X → (Y, Z), when the DMC X → Y to the legitimate receiver is less noisy than the DMC X → Z to the enemy cryptanalyst and there is a probability distribution for X having strictly positive components that achieves capacity on both these channels. In particular, when these DMC's are both symmetric, then the secrecy capacity of the BCC is the difference of their capacities. It is shown further that the less-noisy condition in this result cannot be weakened to the condition that the DMC X → Y be more capable than the DMC X → Z in the sense of Csiszár and Körner. © 1997 IEEE.
Original languageEnglish
Pages (from-to)712-714
JournalIEEE Transactions on Information Theory
Volume43
Issue number2
DOIs
Publication statusPublished - 1997
Externally publishedYes

Fingerprint

Dive into the research topics of 'On a special class of broadcast channels with confidential messages'. Together they form a unique fingerprint.

Cite this