On the Achievability of Interference Channel Coding

被引：0
作者：
Muramatsu, Jun [1 ]
机构：
[1] NTT Corp, NTT Commun Sci Labs, 2-4 Hikaridai,Seika Cho, Kyoto 6190237, Japan
来源：
2022 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, ISITA | 2022年
关键词：
REGION;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper investigates the achievability of interference channel coding. Codes are constructed by using sparse matrices (with logarithmic column degree) and the constrained-random-number generators, where the rate-splitting technique is unnecessary to achieve known inner regions.
引用
收藏
页码：39 / 43
页数：5
相关论文
共 15 条
[1]   CAPACITY REGION OF A CHANNEL WITH 2 SENDERS AND 2 RECEIVERS [J].
AHLSWEDE, R .
ANNALS OF PROBABILITY, 1974, 2 (05) :805-814
[2]   INTERFERENCE CHANNELS [J].
CARLEIAL, AB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :60-70
[3]  
Chong H. F., 2006, P ITA WORKSH SAN DIE
[4]   On the Han-Kobayashi region for the interference channel [J].
Chong, Hon-Fah ;
Motani, Mehul ;
Garg, Hari Krishna ;
El Gamal, Hesham .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (07) :3188-3195
[5]  
El Gamal A, 2011, NETWORK INFORMATION THEORY, P1
[6]  
Han T. S., 2003, Information-Spectrum Methods in Information Theory
[7]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49
[8]   Interference channels with common information [J].
Jiang, Jinhua ;
Xin, Yan ;
Garg, Hari Krishna .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) :171-187
[9]  
Kobayashi K., 2007, P ITA WORKSH SAN DIE
[10]  
Muramatsu J., 2018, P 2018 INT S INF THE, P612
12