{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:31:42Z","timestamp":1764001902003,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620269","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"464-468","source":"Crossref","is-referenced-by-count":40,"title":["Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity"],"prefix":"10.1109","author":[{"given":"Sameer","family":"Pawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483460"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"15","doi-asserted-by":"crossref","first-page":"981","DOI":"10.4310\/CMS.2007.v5.n4.a13","article-title":"Empirical evaluation of a sublinear time sparse dft algorithm","volume":"5","author":"iwen","year":"2007","journal-title":"Communications in Mathematical Sciences"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9057-1"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.915000"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"11","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"tropp","year":"2007","journal-title":"Information Theory IEEE Transactions on"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.1003065"},{"journal-title":"Digital Fountain Inc Luby Digitalfountain Com","year":"2002","author":"luby","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620269"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/29.32276"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"6","article-title":"Essai experimental","author":"prony","year":"1795","journal-title":"J de LEcole Polytechnique"},{"journal-title":"Fast Algorithms for Digital Signal Processing","year":"1985","author":"blahut","key":"5"},{"key":"4","article-title":"Verification codes: Simple ldpc codes for large alphabets","author":"luby","year":"2002","journal-title":"Proc 40th Annu Allerton Conf"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.1986.1143830"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620269.pdf?arnumber=6620269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:45:46Z","timestamp":1498088746000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620269","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}