摘要: Given two discrete memoryless channels (DMC's) with a common input, it is desired to transmit private messages to receiver 1 rate R_ {1} and common messages to both receivers at rate R_ {o}, while keeping receiver 2 as 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}) where R_ {e} is the equivocation rate. Based on this channel coding result, the related source-channel matching problem is also settled …