Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity

2018/11/27 by Jingbo Liu, Liu, Jingbo, Ayfer Özgür +1 · 1 citation
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1811.11303

openalex publication_date 2018/11/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The primitive relay channel, introduced by Cover in 1987, is the simplest single-source single-destination network model that captures some of the most essential features and challenges of relaying in wireless networks. Recently, Wu and Ozgur developed upper bounds on the capacity of this channel that are tighter than the cutset bound. In this paper, we recover, generalize and improve their upper bounds with simpler proofs that rely on a converse technique recently introduced by Liu, van Handel and Verdú that builds on reverse hypercontractivity. To our knowledge, this is the first application of reverse hypercontractivity for proving first-order converses in network information theory.

Citations

• Spherical rearrangements, subharmonic functions, and ∗-functions in n-space
• Logarithmic Sobolev Inequalities

Cited by

• Simple and Sharp Generalization Bounds via Lifting

Related

• A Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications
• Upper-Bounding the Capacity of Relay Communications - Part I
• The Capacity Of Two Way Relay Channel
• "The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case
• Upper-Bounding the Capacity of Relay Communications - Part II