Title :
How fast can dense codes achieve the min-cut capacity of line networks?
Author :
Heidarzadeh, Anoosheh ; Banihashemi, Amir H.
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada
Abstract :
In this paper, we study the coding delay and the average coding delay of random linear network codes (dense codes) over line networks with deterministic regular and Poisson transmission schedules. We consider both lossless networks and networks with Bernoulli losses. The upper bounds derived in this paper, which are in some cases more general, and in some other cases tighter, than the existing bounds, provide a more clear picture of the speed of convergence of dense codes to the min-cut capacity of line networks.
Keywords :
delays; linear codes; losses; network coding; random codes; scheduling; stochastic processes; Bernoulli network loss; Poisson transmission scheduling; average coding delay; dense code; deterministic regular scheduling; lossless networ; min-cut line network capacity; random linear network code; Decoding; Delay; Encoding; Propagation losses; Schedules; Upper bound; Vectors;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6283958
