{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T16:45:55Z","timestamp":1725381955861},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007063","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2915-2919","source":"Crossref","is-referenced-by-count":0,"title":["Density evolution on a class of smeared random graphs"],"prefix":"10.1109","author":[{"given":"Kabir","family":"Chandrasekher","sequence":"first","affiliation":[]},{"given":"Orhan","family":"Ocal","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"journal-title":"Density evolution for deterministic generalized product codes on the binary erasure channel","year":"2015","author":"h\u00e4ger","key":"ref11"},{"journal-title":"Density evolution on a class of smeared random graphs A theoretical framework for fast mri","year":"2017","author":"chandrasekher","key":"ref12"},{"journal-title":"Fast and efficient sparse 2d discrete fourier transform using sparse-graph codes","year":"2015","author":"ong","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914728"},{"article-title":"Wavelets and subband coding","year":"1995","author":"vetterli","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2408558"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref2","first-page":"464","article-title":"Computing a k-sparse n-length discrete fourier transform using at most 4k samples and O(klogk) complexity","author":"pawar","year":"2013","journal-title":"IEEE Int Symp Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007063.pdf?arnumber=8007063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T00:46:06Z","timestamp":1504745166000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007063\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007063","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}