网络上的多源到多宿的相关多播
Multicasting correlated multi-source to multi-sink over a network
摘要：
Ahlswede，Cai，Li和Yeung在2000年首先研究了单源到多链路的多播网络编码问题，建立了独立信道网络上非物理信息流的最大流最小割定理。另一方面，在1980年，Han从多拟阵函数的观点研究了相关的多节点和单个汇点的情况，其中一个充分必要条件已经被证明为可靠的网络传输。本文提出了一种尝试，以统一这两种情况下，这导致建立一个必要和充分条件，可靠的传输在网络多播相关的multisbrands到multisink。文中还讨论了信源编码与信道编码分离的问题。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
