Computer Science – Information Theory
Scientific paper
2010-06-26
Computer Science
Information Theory
14 pages, Submitted to IEEE Transactions in Information Theory
Scientific paper
We establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. We show that unlike the Gaussian case, Marton's coding scheme without superposition coding is not optimal in general even for a degraded broadcast channel with no common message. We then establish properties of Marton's inner bound that help restrict the search space for computing the sum-rate. Next, we show that the inner bound is optimal along certain directions. Finally, we propose a coding scheme that may lead to a larger inner bound.
Anantharam Venkat
El Gamal Abbas
Gohari Amin Aminzadeh
No associations
LandOfFree
On Marton's Inner Bound for the General Broadcast Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Marton's Inner Bound for the General Broadcast Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Marton's Inner Bound for the General Broadcast Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-630326