Bounds on achievable rates for cooperative channel coding

We address the problem of cooperative coding among pairs of transmitters and corresponding pairs of receivers. This may be used, for example, to overcome gaps in a multihop networks. We derive upper bounds on the achievable rates for several cooperation scenarios. We show that transmitter cooperation provides significantly more improvement in rate than receiver cooperation. Based on the theoretical results, we also discuss the possible practical implementation techniques.