{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:58:58Z","timestamp":1774990738644,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541266","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"86-90","source":"Crossref","is-referenced-by-count":1,"title":["Simple algorithms and guarantees for low rank matrix completion over F\n                    <sub>2<\/sub>"],"prefix":"10.1109","author":[{"given":"James","family":"Saunderson","sequence":"first","affiliation":[{"name":"Dept. of Electrical Engineering, University of Washington, United States of America"}]},{"given":"Maryam","family":"Fazel","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, University of Washington, United States of America"}]},{"given":"Babak","family":"Hassibi","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, California Institute of Technology, United States of America"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513545"},{"key":"ref11","article-title":"Decoding error-correcting codes via linear programming","author":"feldman","year":"2003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"ref13","author":"levin","year":"2009","journal-title":"Markov Chains and Mixing Times"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"3187","DOI":"10.1109\/TIT.2010.2048502","article-title":"On the index coding problem and its relation to network coding and matroid theory","volume":"56","author":"el","year":"2010","journal-title":"IEEE Trans Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/0471219282.eot359"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970888"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109679"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874841"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541266.pdf?arnumber=7541266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:24Z","timestamp":1774986684000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541266","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}