A state-dependent discrete memoryless relay channel is considered, with non-causal side informationavailable at both the sender and the relay. The capacity of thisrelay model is an open problem. We improve upon the knownachievable regions for this setting, in addition to proving an outerbound. The key idea in the proof of achievable region is to employa modified decode-forward scheme. The characterization is thenextended to a relay broadcast setting, where an improved innerbound over existing schemes and an outer bound are exhibited.
Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions
