{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:19Z","timestamp":1740131719204,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000084","name":"NSF under SBIR Phase II","doi-asserted-by":"publisher","award":["1534760"],"award-info":[{"award-number":["1534760"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"NSF","doi-asserted-by":"publisher","award":["SaTC- 1813401","CCF-1855879"],"award-info":[{"award-number":["SaTC- 1813401","CCF-1855879"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"2020 IEEE Information Theory and Applications (ITA) Workshop"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/tcomm.2020.2988676","type":"journal-article","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T00:10:12Z","timestamp":1587427812000},"page":"3984-3995","source":"Crossref","is-referenced-by-count":13,"title":["A Sub-Graph Expansion-Contraction Method for Error Floor Computation"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1024-8099","authenticated-orcid":false,"given":"Nithin","family":"Raveendran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Declercq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2365-4106","authenticated-orcid":false,"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394825"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2363832"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048448"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173733"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179842"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.090513.120443"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910589"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090809"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-396499-1.00006-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833352"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913261"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref1","first-page":"1","article-title":"Accurate and efficient error floor computation of LDPC codes using expansion-contraction method","author":"raveendran","year":"2020","journal-title":"Proc Inf Theory Appl Workshop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070048"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015990"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.122112.110805"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2603719"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/9139896\/9072180-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9139896\/09072180.pdf?arnumber=9072180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:47:10Z","timestamp":1651067230000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9072180\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":24,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.2988676","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2020,7]]}}}