Explicit Inner And Outer Bounds For Multi-Source Multi-Sink Network Coding
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS(2006)
摘要
In multi-source multi-sink network coding, messages across different sources are coded to increase the overall throughput. The various types of coded information in the network significantly complicate the determination of its capacity region. In this work, we derive explicit inner and outer bounds for acyclic multi-source multi-sink networks based on a cut-based network decomposition technique and a role-based information characterization technique. In particular, we derive a linear programming inner bound for regular K-pairs acyclic three-layer networks and a network sharing outer bound for arbitrary acyclic multi-source multi-sink networks. The techniques used in this paper reveal some of the basic mechanisms of multi-source multi-sink network coding.
更多查看译文
关键词
encoding,linear program,random variables,decoding,linear programming,throughput,wireless communication,network coding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络