Paper Info
Title
Instantly decodable network codes for real-time applications
Abstract
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, where users have i.i.d. loss probability, and the number of packets is linear or polynomial in the number of users. In this case, we provide a polynomial-time (in the number of users) algorithm that finds the optimal coded packet. Simulation results show that the proposed coding scheme significantly outperforms an optimal repetition code and a COPE-like greedy scheme.
Year
DOI
Venue
2013
10.1109/NetCod.2013.6570827
NetCod
Keywords
DocType
Volume
optimisation,cope,loss recovery,optimal repetition code,loss probability,np-hard problem,greedy scheme,decodable network code,broadcasting applications,probabilistic scenario,delays,polynomial-time algorithm,polynomials,optimal coded packet,probability,network coding,indexes,real time systems,encoding,np hard problem
Journal
abs/1303.7197
ISSN
ISBN
Citations 
2374-9660
978-1-4799-0821-9
48
PageRank 
References 
Authors
1.48
19
4
Name
Order
Citations
PageRank
Anh Le144931.88
Arash Saber Tehrani2996.41
Alexandros G. Dimakis33575206.71
Athina Markopoulou42084121.94