Sub-optimality of the Han--Kobayashi Achievable Region for Interference\n Channels

2015/02/09 by Chandra Nair, Nair, Chandra, Lingxiao Xia +3 · 2 citations
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1502.02589

openalex publication_date 2015/02/09 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

Han-Kobayashi achievable region is the best known inner bound for a general\ndiscrete memoryless interference channel. We show that the capacity region can\nbe strictly larger than the Han-Kobayashi region for some channel realizations,\nand hence the strict sub-optimality of Han-Kobayashi achievable region.\n

Cited by

• Codewords With Memory Improve Achievable Rate Regions of the Memoryless Gaussian Interference Channel
• Trade-off between Communication and Cooperation in the Interference Channel

Related

• Gaussian Interference Channel Capacity to Within One Bit
• The Capacity Region of the One-Sided Gaussian Interference Channel
• Capacity Regions and Bounds for a Class of Z-interference Channels
• An Achievable Rate Region for the Gaussian Interference Channel
• Capacity Bounds for the Gaussian Interference Channel