Optimal Achievable Rates for Interference Networks With Random Codes

From MaRDI portal
Publication:2977161

DOI10.1109/TIT.2015.2476792zbMATH Open1359.94906arXiv1210.4596OpenAlexW2126650154MaRDI QIDQ2977161FDOQ2977161


Authors:


Publication date: 28 April 2017

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

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.


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




Recommendations




Cited In (5)





This page was built for publication: Optimal Achievable Rates for Interference Networks With Random Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977161)