Network Codes for Real-Time Applications

@inproceedings{Le2013NetworkCF,
  title={Network Codes for Real-Time Applications},
  author={Anh Le and Arash Saber Tehrani and Alexandros G. Dimakis and Athina Markopoulou},
  year={2013}
}
We consider the scenario of broadcasting for realtime applications and loss recovery via instantly decodable network coding. Past work focused on minimizing the completion delay, which is not the right objective for real-time applications that have strict deadlines. In this work, we are interested in finding a code that is instantly decodable by the maximum number of users. First, we prove that this problem is NP-Hard in the general case. Then we consider the practical probabilistic scenario… CONTINUE READING