A new achievable scheme for interference relay channels

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.