2012-10-22
How fast can dense codes achieve the min-cut capacity of line networks?
Publication
Publication
Presented at the
2012 IEEE International Symposium on Information Theory, ISIT 2012 (July 2012), Cambridge, MA
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.
| Additional Metadata | |
|---|---|
| Persistent URL | dx.doi.org/10.1109/ISIT.2012.6283958 |
| Conference | 2012 IEEE International Symposium on Information Theory, ISIT 2012 |
| Citation |
Heidarzadeh, A. (Anoosheh), & Banihashemi, A. (2012). How fast can dense codes achieve the min-cut capacity of line networks?. In IEEE International Symposium on Information Theory - Proceedings (pp. 2461–2465). doi:10.1109/ISIT.2012.6283958
|