scientific article; zbMATH DE number 5455150

MaRDI QIDQ3547835zbMATH OpenFDO

Authors Xijin Yan, Jun Yang, Zhen Zhang

Publication date 21 December 2008

zbMATH Keywords

network codingside informationmax-flow min-cut boundmultisource multisink networknetwork sharing boundthree-layer network

Mathematics Subject Classification ID

Communication theory (94A05) Circuits, networks (94C99) Source coding (94A29) Communication networks in operations research (90B18)

Recommendations

• An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding
• An improved outer bound for multiterminal source coding
• Minimum Cost Distributed Source Coding Over a Network
• Min-Cost Selfish Multicast With Network Coding
• Bounding the Coding Advantage of Combination Network Coding in Undirected Networks
• Lower Bounds for Multiplication via Network Coding
• A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
• Minimum-Cost Multicast over Coded Packet Networks
• A Reduction Approach to the Multiple-Unicast Conjecture in Network Coding
• The Complexity of Network Coding With Two Unit-Rate Multicast Sessions

Cited in

(2)

• scientific article; zbMATH DE number 1978135 (Why is no real title available?)
• An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547835)