2012/02/02 by Anoosheh Heidarzadeh, Amir H. Banihashemi, Heidarzadeh, Anoosheh +1 · 1 citation
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1202.0343
15 pages, submitted to IEEE ISIT 2012
arxiv created 2012/02/02 · arxiv updated 2012/02/03
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.