How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?

Details How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks? How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?

2012-02-02

arxiv.org/abs/1202.0343v1

Computer Science

Information Theory

15 pages, submitted to IEEE ISIT 2012

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-186656