Download now Free registration required
Network coding applied to broadcast erasure channels can usually improve the throughput substantially. For example, random linear network coding is capacity achieving for a single multicast connection. The authors consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, they formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, they investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.
- Format: PDF
- Size: 2416.64 KB