On The Han–Kobayashi Region for theInterference Channel

By Hon-Fah Chong, Mehul Motani, Hari Krishna Garg, Hesham El Gamal. IEEE Transactions on Information Theory, 2008

330 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Gaussian Interference Channel Capacity to Within One Bit (2007, background): “Recently, a simplified yet equivalent Han–Kobayashi achievable region was given in [ 10 ] which we state next in Lemma 1. The achievability of this simplified region was later proved with a direct coding theorem in [11, Theorem 1] (see [11, Sec.”
Capacity bounds for the Gaussian Interference Channel (2008, methodology): “We define G0 as the naive HK achievable region (we use a shorter description of G0 obtained in [10]).”
A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels (2007, methodology): “A simplified form of the Han–Kobayashi region was given by Chong–Motani–Garg–El Gamal [ 6 ], [7].”
Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region (2008, methodology): “ log 1 + h2 21P 1 + P 1 1 + h2 12P 2 and similar substitutions for the terms corresponding to user 2. The form of the outer bound given in Lemma 9 is strikingly similar to the simpliﬁed HK region [7], and in fact a special case of the HK region is shown to be within one bit of the outer bound [9],”
Noisy Network Coding (2010, methodology): “3) Simultaneous nonunique decoding has been used in varioussettings,e.g., interferencechannels[ 20 ]andbroadcast channels [21].”