Aristotle University of Thessaloniki
The authors study the case of the three-user broadcast erasure channel, with multiple unicast traffic, where feedback from the users is fed back to the transmitter in the form of ACK/NACK messages. The capacity region of this system has been recently derived and two capacity achieving algorithms, employing intersession linear network coding, have been proposed in,. Since these algorithms suffer from large computational complexity and decoding delay, their aim in this paper is to design coding algorithms with reduced computational complexity and low decoding delay that achieve comparable throughput to the former algorithms. They exclusively consider algorithms that require no knowledge of channel statistics, perform only XOR operations between the packets and allow for instantaneous decoding by any receiver that successfully receives a packet.