Adaptive network coding for broadcast channels
Authors:
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23749660,p. 80-85
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Online network coding for optimal throughput and delay - the three-receiver case2008
- Finite-state Markov modeling of fading channels - a survey of principles and applicationsIEEE Signal Processing Magazine, 2008
- ARQ for network coding2008
- Online Broadcasting with Network Coding2008
- XORs in the air2006
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Multiple description coding: compression meets the networkIEEE Signal Processing Magazine, 2001
- On local search for weighted κ-set packingLecture Notes in Computer Science, 1997
- Capacity and coding for the gilbert-elliott channelsIEEE Transactions on Information Theory, 1989
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing ProblemsSIAM Journal on Discrete Mathematics, 1989