Multicasting correlated multi-source to multi-sink over a network

Details Multicasting correlated multi-source to multi-sink over a network Multicasting correlated multi-source to multi-sink over a network

2009-01-06

arxiv.org/abs/0901.0608v7

Computer Science

Information Theory

Scientific paper

The problem of network coding with multicast of a single source to multisink has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the celebrated max-flow mini-cut theorem on non-physical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with correlated multisource and a single sink from the viewpoint of polymatroidal functions in which a necessary and sufficient condition has been demonstrated for reliable transmission over the network. This paper presents an attempt to unify both cases, which leads to establish a necessary and sufficient condition for reliable transmission over a network multicasting correlated multisource to multisink. Here, the problem of separation of source coding and channel coding is also discussed.

Affiliated with

Also associated with

No associations

Rating

Multicasting correlated multi-source to multi-sink over a network 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 Multicasting correlated multi-source to multi-sink over a network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multicasting correlated multi-source to multi-sink over a network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632046