DocumentCode :
928607
Title :
Broadcast channels with confidential messages
Author :
Csiszar, Imre ; Korner, Janos
Volume :
24
Issue :
3
fYear :
1978
fDate :
5/1/1978 12:00:00 AM
Firstpage :
339
Lastpage :
348
Abstract :
Given two discrete memoryless channels (DMC\´s) with a common input, it is desired to transmit private messages to receiver 
rate 
and common messages to both receivers at rate 
, while keeping receiver 
as ignorant of the private messages as possible. Measuring ignorance by equivocation, a single-letter characterization is given of the achievable triples 
where 
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.
rate and common messages to both receivers at rate , while keeping receiver as ignorant of the private messages as possible. Measuring ignorance by equivocation, a single-letter characterization is given of the achievable triples where 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.Keywords :
Broadcast channels; Cryptography; Broadcasting; Channel coding; Degradation; Memoryless systems; Mutual information; Stochastic processes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1978.1055892
Filename :
1055892
Link To Document :
