Answers are grounded in this paper and cite their sources.
In this, the second part of a two-part paper, we apply the result of Part I [9] to three problems in multi-user communication. 1) For the special case of the broadcast channel where both channels are binary symmetric, we establish a converse result that shows the ad hoc scheme suggested by Cover and Bergmans [2], [3l is in fact optimal. 2) For a modified version of a source coding problem with side information of Slepian and Wolf [3], we establish a converse result. 3) We show that the "common information" of a certain pair of dependent random variables is zero.
No takes yet. Share an insight, caveat, or question.
A.D. Wyner (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: