On Random Network Coding for Multicast

Details On Random Network Coding for Multicast On Random Network Coding for Multicast

2007-02-09

arxiv.org/abs/cs/0702052v1

Computer Science

Information Theory

5 pages, 4 figures. Submitted to 2007 IEEE International Symposium on Information Theory

Scientific paper

Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required sources. One of the main theoretical motivations for random network codes stems from the lower bound on the probability of successful decoding reported by Ho et. al. (2003). This result demonstrates that all sinks in a linearly solvable network can successfully decode all sources provided that the random code field size is large enough. This paper develops a new bound on the probability of successful decoding.

Affiliated with

Also associated with

No associations

Rating

On Random Network Coding for Multicast 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 On Random Network Coding for Multicast, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Random Network Coding for Multicast will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8116