Forward decoding over a relay channel

A communication strategy proposed by Cover and El Gamal was until recently the best known achievable scheme over a discrete memoryless relay channel ([1], Theorem 7). This strategy combines cooperation and facilitation between the transmitter and relay. A possible improvement to this achievable region recently appeared in literature [2].We present an alternate achievability proof of the region in [2] using the so called irregular encoding and foward decoding strategy.