2000 character limit reached
Achievable Rates for a Two-Relay Network with Relays-Transmitter Feedbacks
Published 10 Nov 2011 in cs.IT and math.IT | (1111.2430v1)
Abstract: We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and cooperation analogue to what proposed by Cover and El Gamal for a relay channel. In addition to random binning, we use deterministic binning to perform restricted decoding. We show how to use the feedback links for cooperation between the sender and the relays to transmit the information which is compressed in the sender and the relays.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.