Computer Science – Information Theory
Scientific paper
2010-10-10
Computer Science
Information Theory
4 pages, 1 figure, to appear in Proceedings of ICITIS 2010
Scientific paper
In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding was proposed as an acceptable coding technique. In this paper, we further study the performance of random linear network coding by analyzing the failure probabilities at sink node for different knowledge of network topology and get some tight and asymptotically tight upper bounds of the failure probabilities. In particular, the worst cases are indicated for these bounds. Furthermore, if the more information about the network topology is utilized, the better upper bounds are obtained. These bounds improve on the known ones. Finally, we also discuss the lower bound of this failure probability and show that it is also asymptotically tight.
Fu Fang-Wei
Guang Xuan
No associations
LandOfFree
The Failure Probability at Sink Node of Random Linear Network Coding 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 The Failure Probability at Sink Node of Random Linear Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Failure Probability at Sink Node of Random Linear Network Coding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-88019