{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:09:20Z","timestamp":1781341760938,"version":"3.54.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/tit.2017.2723898","type":"journal-article","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T18:10:37Z","timestamp":1499364637000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["Low rank approximation and decomposition of large matrices using error correcting codes"],"prefix":"10.1109","author":[{"given":"Shashanka","family":"Ubaru","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yousef","family":"Saad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1396","article-title":"Randomized block Krylov methods for stronger and faster approximate singular value decomposition","author":"musco","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref33","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory Error-Correcting Codes"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709640104"},{"key":"ref31","article-title":"Accelerated dense random projections","author":"liberty","year":"2009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"ref37","first-page":"649","article-title":"On almost disjunct matrices for group testing","author":"mazumdar","year":"2012","journal-title":"Computer Algorithms"},{"key":"ref36","article-title":"Combinatorial methods in coding theory","author":"mazumdar","year":"2011"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-2227-2","author":"markovsky","year":"2012","journal-title":"Low Rank Approximation Algorithms Implementation Applications"},{"key":"ref34","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemp Math"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref29","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9110-x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref20","first-page":"1127","article-title":"Sampling algorithms for $\\ell_{2}$ regression and applications","author":"drineas","year":"2006","journal-title":"Proc 7th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref22","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","author":"golub","year":"2013","journal-title":"Matrix Computations"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/130938700"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541822"},{"key":"ref51","first-page":"702","article-title":"Low rank approximation using error correcting coding matrices","author":"ubaru","year":"2015","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-3561-6"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494219"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.12.002"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00951"},{"key":"ref52","first-page":"468","article-title":"Fast methods for estimating the numerical rank of large matrices","author":"ubaru","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/120874540"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536446"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref14","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.720545"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509922"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2448658"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.18.10101"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797556"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1147\/rd.233.0299"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1037127"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACV.1994.341300"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0812680106"},{"key":"ref42","first-page":"455","article-title":"Principal components analysis to summarize microarray experiments: Application to sporulation time series","author":"raychaudhuri","year":"2000","journal-title":"Proc Pacific Symp Biocomput"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2005.1628618"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0804869105"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/080736417"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/4667673\/07970174.pdf?arnumber=7970174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T08:41:18Z","timestamp":1719304878000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7970174\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2723898","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}