Provided by: Cornell University
Date Added: Mar 2015
In this paper, the authors consider a setting in which a sender wishes to broadcast a block of k data packets to a set of wireless receivers, where each of the receivers has a subset of the data packets already available to it (e.g., from prior transmissions) and wants the rest of the packets. Their goal is to find a linear network coding scheme that yields the minimum Average Packet Decoding Delay (APDD), i.e., the average time it takes for a receiver to decode a data packet. Their contributions can be summarized as follows.