Optimal Achievable Rates for Interference Networks With Random Codes.
Saved in:
| Title: | Optimal Achievable Rates for Interference Networks With Random Codes. |
|---|---|
| Authors: | Bandemer, Bernd1, El Gamal, Abbas2, Kim, Young-Han3 |
| Source: | IEEE Transactions on Information Theory. Dec2015, Vol. 61 Issue 12, p6536-6549. 14p. |
| Subject Terms: | RANDOM codes (Coding theory), SUPERPOSITION principle (Physics), MATHEMATICAL bounds, INTERFERENCE channels (Telecommunications), MAXIMUM likelihood decoding |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!