Optimal Achievable Rates for Interference Networks with Random Codes
Abstract
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region regardless of the relative strengths of signal, interference, and noise. This result implies that the Han-Kobayashi bound, the best known inner bound on the capacity region of the two-user-pair interference channel, cannot be improved merely by using the optimal maximum likelihood decoder.
Cite
@article{arxiv.1210.4596,
title = {Optimal Achievable Rates for Interference Networks with Random Codes},
author = {Bernd Bandemer and Abbas El Gamal and Young-Han Kim},
journal= {arXiv preprint arXiv:1210.4596},
year = {2016}
}
Comments
28 pages, 10 figures; extended version with complete proofs, submitted for publication to IEEE Transactions on Information Theory