On Marton's Inner Bound for the General Broadcast Channel
The authors establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. They 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. They then establish properties of Marton's inner bound that help restrict the search space for computing the sum-rate. Next, they show that the inner bound is optimal along certain directions. Finally, they propose a coding scheme that may lead to a larger inner bound.