Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
arXiv:1407.2417 · doi:10.1109/TIT.2016.2584082
Abstract
This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the set of achievable rate tuples. The strong converse for these classes of DM-MMNs implies that all sequences of codes with rate tuples belonging to the exterior of the cut-set bound have average error probabilities that necessarily tend to one (and are not simply bounded away from zero). Examples in the classes of DM-MMNs include wireless erasure networks, DM-MMNs consisting of independent discrete memoryless channels (DMCs) as well as single-destination DM-MMNs consisting of independent DMCs with destination feedback. Our elementary proof technique leverages properties of the Rényi divergence.
arXiv commentSubmitted to IEEE Transactions on Information Theory, Jul 18, 2014. Revised on Jul 31, 2015
References in corpus (6)
- Rényi Divergence and Kullback-Leibler Divergence
- Wireless Network Information Flow: A Deterministic Approach
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Strong Converse to the Quantum Channel Coding Theorem
- Slepian-Wolf Coding Over Cooperative Relay Networks
- On the Reliability Function of the Discrete Memoryless Relay Channel