Interference Decoding for Deterministic Channels

DOI10.1109/TIT.2011.2119890zbMATH Open1366.94687arXiv1001.4588OpenAlexW3103467287MaRDI QIDQ5280939

Author name not available (Why is that?)

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference-decoding inner bound is tight under certain strong interference conditions. The inner bound is also shown to strictly contain the inner bound obtained by treating interference as noise, which includes interference alignment for deterministic channels. The gain comes from judicious analysis of the number of combined interference sequences in different regimes of input distributions and message rates. Finally, the inner bound is generalized to the case where each channel output is observed through a noisy channel.

Full work available at URL: https://arxiv.org/abs/1001.4588

Mathematics Subject Classification ID

Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24) Source coding (94A29)