Simple algorithms and guarantees for low rank matrix completion over F2
暂无分享,去创建一个
[1] Ziv Bar-Yossef,et al. Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.
[2] David R. Karger,et al. The complexity of matrix completion , 2006, SODA '06.
[3] V. Climenhaga. Markov chains and mixing times , 2013 .
[4] Jon Feldman,et al. Decoding error-correcting codes via linear programming , 2003 .
[5] 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.
[6] Babak Hassibi,et al. A matrix completion approach to linear index coding problem , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).
[7] Vincent Y. F. Tan,et al. Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations , 2011, IEEE Transactions on Information Theory.
[8] Sriram Vishwanath,et al. Information theoretic bounds for low-rank matrix completion , 2010, 2010 IEEE International Symposium on Information Theory.
[9] Alexander Barg,et al. Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.
[10] Alexander Sprintson,et al. On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.
[11] Alexandros G. Dimakis,et al. Graph theory versus minimum rank for index coding , 2014, 2014 IEEE International Symposium on Information Theory.
[12] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[13] Tetsunao Matsuta,et al. 国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .