Strong converse theorems for multimessage networks with tight cut-set bound
From MaRDI portal
Publication:2190898
DOI10.1134/S0032946019010046zbMath1452.94002arXiv1606.04678MaRDI QIDQ2190898
Vincent Y. F. Tan, Silas L. Fong
Publication date: 23 June 2020
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.04678
Communication theory (94A05) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Unnamed Item
- Unnamed Item
- Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
- On the Reliability Function of the Discrete Memoryless Relay Channel
- Reliability in Source Coding With Side Information
- Network Information Theory
- Maximal Flow Through a Network
- The capacity of the white Gaussian multiple access channel with feedback
- Capacity of wireless erasure networks
- Capacity of a Class of Relay Channels With Orthogonal Components
- Cooperative Strategies and Capacity Theorems for Relay Networks
- A simple proof of the blowing-up lemma (Corresp.)
- Capacity theorems for the relay channel
- Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
- The capacity of the semideterministic relay channel (Corresp.)
- Guessing subject to distortion
- Capacity of a Class of Modulo-Sum Relay Channels
- On Gaussian Channels With Feedback Under Expected Power Constraints and With Non-Vanishing Error Probabilities
- Wireless Network Information Flow: A Deterministic Approach
- A Theory of Network Equivalence— Part I: Point-to-Point Channels
- Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities
- Information Theory
