On Marton's Inner Bound for the General Broadcast Channel

Abstract

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.

14 pages, Submitted to IEEE Transactions in Information Theory

References in corpus (2)

• On Marton's Inner Bound for the General Broadcast Channel
• A note on outer bounds for broadcast channel

Cited by in corpus (14)

• Polar Codes For Broadcast Channels
• On Marton's Inner Bound for the General Broadcast Channel
• Distributed Information-Theoretic Clustering
• Monotone Measures for Non-Local Correlations
• Classical codes for quantum broadcast channels
• The capacity region of classes of product broadcast channels
• Multiple Access Channel Simulation
• Linear Bounds between Contraction Coefficients for $f$-Divergences
• Extremal Mechanisms for Pointwise Maximal Leakage
• Duality of a Source Coding Problem and the Semi-Deterministic Broadcast Channel with Rate-Limited Cooperation
• On Dimension Bounds for Auxiliary Quantum Systems
• Achievable rate region for three user discrete broadcast channel based on coset codes
• Outer Bounds on the Admissible Source Region for Broadcast Channels with Correlated Sources
• One-shot Multiple Access Channel Simulation