Optimal Achievable Rates for Interference Networks With Random Codes
From MaRDI portal
Publication:2977161
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.
Recommendations
- Achievable Rates for $K$-User Gaussian Interference Channels
- On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
- Maximizing the Sum Rate in Symmetric Networks of Interfering Links
- On Achievable Rate Regions for the Gaussian Interference Channel
- On the Achievable Sum Rate for MIMO Interference Channels
- On the Achievable Rate Regions for Interference Channels With Degraded Message Sets
- A new achievable rate region for the interference channel
- Maximum-Rate Transmission With Improved Diversity Gain for Interference Networks
- Interference Networks With Point-to-Point Codes
Cited in
(5)- On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
- Achieving positive rates with predetermined dictionaries
- Achievable Rates for Nonlinear Volterra Channels
- On the Achievable Rate Regions for Interference Channels With Degraded Message Sets
- scientific article; zbMATH DE number 6866311 (Why is no real title available?)
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)