A coding theorem for the discrete memoryless broadcast channel

Marton, Katalin

doi:10.1109/tit.1979.1056046

Cited by 529 publications

(631 citation statements)

References 9 publications

Supporting

Mentioning

610

Contrasting

Order By: Relevance

“…To see that this is indeed an outer bound, note that it is simply the Körner-Marton [16] outer bound without the sum rate bound. The outer boundR 1 can be alternatively represented in terms of its supporting hyperplanes as:…”

Section: Effectively Less Noisy P-bcmentioning

confidence: 99%

Superposition coding is almost always optimal for the Poisson broadcast channel

Kim

Nachman

Gamal

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

This paper shows that the capacity region of the continuous-time Poisson broadcast channel is achieved via superposition coding for most channel parameter values. Interestingly, the channel in some subset of these parameter values does not belong to any of the existing classes of broadcast channels for which superposition coding is optimal (e.g., degraded, less noisy, more capable). In particular, we introduce the notion of effectively less noisy broadcast channel and show that it implies less noisy but is not in general implied by more capable. For the rest of the channel parameter values, we show that there is a gap between Marton's inner bound and the UV outer bound.

show abstract

Section: Effectively Less Noisy P-bcmentioning

confidence: 99%

Superposition coding is almost always optimal for the Poisson broadcast channel

Kim

Nachman

Gamal

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…The main difficulty for developing such a scheme can be perhaps recognized from the fact that the crucial component of Marton coding [13] for the (single-hop) broadcast channel is careful coordination between the codewords for different messages. For multihop networks, similar coordination becomes far more challenging since the source should control the codewords transmitted from multiple nodes.…”

Section: Introductionmentioning

confidence: 99%

Distributed decode-forward for multicast

Lim

Kim

2014

2014 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-A new coding scheme for multicasting a message over a general relay network is presented that extends both network coding for graphical networks by Ahlswede, Cai, Li, and Yeung, and partial decode-forward for relay channels by Cover and El Gamal. For the N -node Gaussian multicast network, the scheme achieves within 0.5N bits from the capacity, improving upon the best known capacity gap results. The key idea is to use multicoding at the source as in Marton coding for broadcast channels. Instead of recovering a specific part of the message as in the original partial decode-forward scheme, a relay in the proposed distributed decode-forward scheme recovers an auxiliary index that implicitly carries some information about the message and forwards it in block Markov coding. This scheme can be adapted to broadcasting multiple messages over a general relay network, extending and refining a recent result by Kannan, Raja, and Viswanath.

show abstract

“…The error probability analysis of theorem 1 here is similar to the error probability analysis process in Marton's classic paper [7], so the discussion will not be repeated here.…”

Section: Error Probability Analysismentioning

confidence: 99%

Research on the Secrecy Achievable Rate Region for the Broadcast channel with eavesdropper

Zhu¹,

Xiao²,

Zhou³

et al. 2013

Advances in Intelligent Systems Research

View full text Add to dashboard Cite

Abstract-This paper considers the problems of the achievable rate regions on broadcast channel with the eavesdropper. Many articles have given the meaningful results, like the inner bound of this model. However, the specific analysis processes for this model have not been given by previous work. So we focus on the study of the secrecy achievable rate regions on broadcast channel with eavesdropper and get a detailed analysis of the inner bounder.Keywords-Broadcast channel; eavesdropper; inner bounder; secrecy achievable rate region.

show abstract

A coding theorem for the discrete memoryless broadcast channel

Cited by 529 publications

References 9 publications

Superposition coding is almost always optimal for the Poisson broadcast channel

Superposition coding is almost always optimal for the Poisson broadcast channel

Distributed decode-forward for multicast

Research on the Secrecy Achievable Rate Region for the Broadcast channel with eavesdropper

Contact Info

Product

Resources

About