A characterization of solvability for a class of networks
- 作者Chen Yuan; HaiBin Kan
- 卷第55卷
- 期第4期
- 文件大小279.03KB
- 发表时间2012-04
- DOI10.1007/s11432-011-4461-y
- 页码747-754
同作者推荐
Holographic reduction for some counting problemsChen Yuan; Haibin Kan · 2011
Smaller Bound of SuperconcentratorYUAN, Chen; KAN, Haibin · IEICE Transactions on Information and Systems · 2012
A construction method of matroidal networksChen Yuan, HaiBin Kan, Xin Wang, Hideki Imai · 2012
A novel elementary construction of matching vectorsChen Yuan; Qian Guo; Haibin Kan · 2012
Explicit-form complex orthogonal design for space-time block codesYuan Li, Chen Yuan, HaiBin Kan · 2013
The maximal rates and minimal decoding delay of more general complex orthogonal designsYuan Li; HaiBin Kan; Chen Yuan; HuanFei Ma · 2010
A note on sparse solutions of sparse linear systemsYuan, Chen; Kan, Haibin · Theoretical Computer Science · 2014