Strong converse theorems for multimessage networks with tight cut-set bound

DOI10.1134/S0032946019010046MaRDI QIDQ2190898zbMATH OpenFDO

Authors Silas L. Fong, Vincent Y. F. Tan

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

Mathematics Subject Classification ID

Theory of organizations, manpower planning in operations research (90B70) Communication theory (94A05)

Abstract: This paper considers a multimessage network where each node may send a message to any other node in the network. Under the discrete memoryless model, we prove the strong converse theorem for any network whose cut-set bound is tight, i.e., achievable. Our result implies that for any fixed rate vector that resides outside the capacity region, the average error probabilities of any sequence of length-$n$ codes operated at the rate vector must tend to $1$ as $n$ approaches infinity. The proof is based on the method of types and is inspired by the work of Csisz'{a}r and K"{o}rner in 1982 which fully characterized the reliability function of any discrete memoryless channel (DMC) with feedback for rates above capacity. In addition, we generalize the strong converse theorem to the Gaussian model where each node is subject to an almost-sure power constraint. Important consequences of our results are new strong converses for the Gaussian multiple access channel (MAC) with feedback and the following relay channels under both models: The degraded relay channel (RC), the RC with orthogonal sender components, and the general RC with feedback.

Recommendations

• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• A Strong Converse Theorem for Quantum Multiple Access Channels
• A Strong Converse Theorem for Quantum Multiple Access Channels
• A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback
• Strong converse to the quantum channel coding theorem

Cites work

• A simple proof of the blowing-up lemma (Corresp.)
• A Theory of Network Equivalence— Part I: Point-to-Point Channels
• Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities
• Capacity of a Class of Modulo-Sum Relay Channels
• Capacity of a Class of Relay Channels With Orthogonal Components
• Capacity of wireless erasure networks
• Capacity theorems for the relay channel
• Cooperative Strategies and Capacity Theorems for Relay Networks
• Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
• Guessing subject to distortion
• scientific article; zbMATH DE number 3181534 (Why is no real title available?)
• scientific article; zbMATH DE number 1821199 (Why is no real title available?)
• Information theory. Coding theorems for discrete memoryless systems
• Maximal Flow Through a Network
• Network information theory
• On Gaussian Channels With Feedback Under Expected Power Constraints and With Non-Vanishing Error Probabilities
• On the Reliability Function of the Discrete Memoryless Relay Channel
• Reliability in Source Coding With Side Information
• Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
• The capacity of the semideterministic relay channel (Corresp.)
• The capacity of the white Gaussian multiple access channel with feedback
• Wireless Network Information Flow: A Deterministic Approach

This page was built for publication: Strong converse theorems for multimessage networks with tight cut-set bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190898)