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 条

[11] Channel Code Using Constrained-Random-Number Generator Revisited
Muramatsu, Jun
Miyake, Shigeki
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (01) : 500 - 510
[12] Channel Coding and Lossy Source Coding Using a Generator of Constrained Random Numbers
Muramatsu, Jun
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) : 2667 - 2686
[13] Nair C, 2015, IEEE INT SYMP INFO, P2416, DOI 10.1109/ISIT.2015.7282889
[14] General relayless networks: representation of the capacity region
Somekh-Baruch, Anelia
Verdu, Sergio
[J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2408 - +
[15] A GENERAL FORMULA FOR CHANNEL CAPACITY
VERDU, S
HAN, TS
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1147 - 1157

← 1 2 →