This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse matrices (with logarithmic column degree) and the constrained-random-number generators. By extending the problem, we can establish a possible extension of known inner regions.
翻译:本文调查了干扰通道编码的可实现性,澄清了分率技术对于实现汉库林和建新加尔格内部区域是不必要的,代码是使用稀少的矩阵(具有对数柱度)和限制随机数生成器构建的,通过扩大问题的范围,我们可以确定已知内部区域可能的延伸。