Sadeghi, Parastoo; Traskov, Danail; Koetter, Ralf
We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.