This article shows that achieving capacity region of a 2-users weak Gaussian Interference Channel (GIC) is equivalent to enlarging the core in a nested set of Polymatroids (each equivalent to capacity region of a multiple-access channel) through maximizing a minimum rate, then projecting along its orthogonal span and continuing recursively. This formulation relies on defining dummy private messages to capture the effect of interference in GIC. It follows that relying on independent Gaussian random code-books is optimum, and the corresponding solution corresponds to achieving the boundary in HK constraints.

翻译：本文指出,获得2个用户薄弱高斯干涉频道(GIC)的能力区域,相当于通过最大限度地提高最低速率,然后沿着其正方形间距投射并连续循环,扩大嵌套的一组多孔机器人(均相当于多接入频道的能力区域)的核心核心部分。这一提法依靠界定假的私人信息来捕捉干扰高斯干涉频道的影响。 因此,依靠独立的高斯随机代码是最佳的,相应的解决方案与在香港的制约因素中达到的界限相对应。