A characterization of solvability for a class of networks
A characterization of solvability for a class of networks作者机构：Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China
出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))
年 卷 期：2012年第55卷第4期
页 面：747-754页
核心收录：
学科分类：07[理学] 08[工学] 070104[理学-应用数学] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程]
基 金：supported by National Natural Science Foundations of China(Grant Nos.61170208,60832001,60802011) Research Fund for the Doctoral Program of Higher Education of China(Grant No.20090071110073) Fox Ying Yung Education Foundation(Grant No.114401) Shu Guang Project supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation(Grant No.10SG01)
主 题：capacity coding capacity network coding solvability
摘 要：In this paper,we find that Property P can be generalized to characterize the solvability of a kind of networks with any number of sources,thus partially answering the open problem as to whether there are properties similar to Property P to characterize the solvability of some *** an application,for a given integer n,we construct such a solvable network that has no solvable solution if its alphabet size is less than n.
同方期刊数据库