Abstract
We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding. We apply our achievability to two cases. First, we characterize the capacity region of some classes of discrete memoryless interference relay channels. These classes naturally generalize the injective deterministic discrete memoryless interference channel by El Gamal and Costa and the discrete memoryless relay channel. Moreover, for the Gaussian interference relay channel with orthogonal receiver components, we show that our scheme achieves a better sum rate than that of noisy network coding.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
