{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T02:10:45Z","timestamp":1785031845467,"version":"3.55.0"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/tit.2010.2040892","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T19:51:52Z","timestamp":1269460312000},"page":"2002-2016","source":"Crossref","is-referenced-by-count":44,"title":["Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling"],"prefix":"10.1109","volume":"56","author":[{"given":"David L.","family":"Donoho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Tanner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.15"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502258102"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00600-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2009.0152"},{"key":"ref15","author":"kendall","year":"1991","journal-title":"Kendall's Advanced Theory of Statistics"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1235-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02546523"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1155\/IMRN.2005.4019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20227"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref3","first-page":"295","article-title":"Error correction via linear programming","author":"cand\ufffds","year":"2005","journal-title":"Proc FOCS 2005 (46th Ann Symp Found Comput Sci"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref7","author":"donoho","year":"2005","journal-title":"Neighborly Polytopes and Sparse Solutions of Underdetermined Linear Equations"},{"key":"ref2","author":"blanchard","year":"2008","journal-title":"Compressed Sensing How Sharp is the RIP?"},{"key":"ref1","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5437371\/05437438.pdf?arnumber=5437438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T02:54:04Z","timestamp":1640228044000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5437438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":19,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2040892","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}