General broadcast channels with degraded message sets
IEEE Transactions on Information TheoryPublished 1 January 1977
János Körner, K. Marton
Citations326
SJR quartileQ1
SJR score1.46
SNIP1.76
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The coding theorem and strong converse for this communication situation is proved for the case when one of the private messages has rate zero.
Abstract
A broadcast channel with one sender and two receivers is considered. Three independent messages are to be transmitted over this channel: one common message which is meant for both receivers, and one private message for each of them. The coding theorem and strong converse for this communication situation is proved for the case when one of the private messages has rate zero.
Keywords
Computer ScienceEngineering
IEEE Transactions on Information TheoryBroadcast channels
1,702 Citations1972Thomas M. Cover
This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.
IEEE Transactions on Information TheoryRandom coding theorem for broadcast channels with degraded components
512 Citations1973P. Bergmans
This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels with N components, and shows a procedure to expurgate a good random broadcast code leading to a bound on the maximum probability of error.
IEEE Transactions on Information TheorySource coding with side information and a converse for degraded broadcast channels
446 Citations1975Rudolf Ahlswede, János Körner
In Section H of the paper, a characterization of the capacity region for degraded broadcast channels (DBC's) is given, which was conjectured by Bergmans and is somewhat sharper than the one obtained by Gallager.
IEEE Transactions on Information TheoryA theorem on the entropy of certain binary sequences and applications--II
255 Citations1973A.D. Wyner
A theorem concerning the entropy of a certain sequence of binary random variables is established and this result is applied to the solution of three problems in multi-user communication.
IEEE Transactions on Information TheoryAn achievable rate region for the broadcast channel
183 Citations1975Thomas M. Cover
The achievability of the region is shown by using a version of the asymptotic equipartition property involving many simultaneous "typicality" constraints, which generalize to yield an achievable rate region for the m -sender n -receiver channel in terms of standard mutual information quantities.
IEEE Transactions on Information TheoryA theorem on the entropy of certain binary sequences and applications--I
172 Citations1973Abraham J. Wyner, J. Ziv
Probability Theory and Related FieldsBounds on conditional probabilities with applications in multi-user communication
156 Citations1976Rudolf Ahlswede, P. G�cs +1 more
IEEE Transactions on Information TheoryRandom coding theorems for the general discrete memoryless broadcast channel
98 Citations1975E. van der Meulen
Three different communication situations are considered for the general nondegraded discrete memoryless broadcast channel with two components and it is shown that in the most general situation the inner bound strictly dominates the family of rates obtained by time-sharing.
IEEE Transactions on Information TheoryImages of a set via two channels and their role in multi-user communication
75 Citations1977János Körner, K. Marton
A technique is presented to determine the region of achievable rates for some source and channel networks and this technique is applied to the solution of a source:network problem.