Broadcast channels with confidential messages
Csiszar, I.; Korner, J.
Information Theory, IEEE Transactions on
Volume 24, Issue 3, May 1978 Page(s): 339 - 348
Digital Object Identifier  
Summary: Given two discrete memoryless channels (DMC's) with a common input, it is desired to transmit private messages to receiver1rateR_{1}and common messages to both receivers at rateR_{o}, while keeping receiver2as ignorant of the private messages as possible. Measuring ignorance by equivocation, a single-letter characterization is given of the achievable triples(R_{1},R_{e},R_{o})whereR_{e}is the equivocation rate. Based on this channel coding result, the related source-channel matching problem is also settled. These results generalize those of Wyner on the wiretap channel and of Körner-Marton on the broadcast Channel.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.