A fast matrix completion method for index coding
暂无分享,去创建一个
[1] Tengyao Wang,et al. A useful variant of the Davis--Kahan theorem for statisticians , 2014, 1405.0680.
[2] Ziv Bar-Yossef,et al. Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.
[3] Michael Langberg,et al. On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.
[4] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[5] Farrokh Marvasti,et al. Iterative Null-space Projection Method with Adaptive Thresholding in Sparse Signal Recovery and Matrix Completion , 2016, IET Signal Process..
[6] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[7] Yitzhak Birk,et al. Informed-source coding-on-demand (ISCOD) over broadcast channels , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[8] Urs Niesen,et al. Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[9] Xiao Huang,et al. Index coding and network coding via rank minimization , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).
[10] Babak Hassibi,et al. A matrix completion approach to linear index coding problem , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).