On the Achievability of Interference Channel Coding
Information Theory
2022-08-26 v2 math.IT
Abstract
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.
Cite
@article{arxiv.2201.10756,
title = {On the Achievability of Interference Channel Coding},
author = {Jun Muramatsu},
journal= {arXiv preprint arXiv:2201.10756},
year = {2022}
}
Comments
71 pages (v1) the full version of the paper submitted to IEEE ISIT2022 (v2) typos are corrected, the full version of the paper submitted to 2022 IEICE International Symposium on Information Theory and its Applications (ISITA2022)