{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:51:24Z","timestamp":1745560284993,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC Discovery","doi-asserted-by":"publisher","award":["217239-2013-RGPIN"],"award-info":[{"award-number":["217239-2013-RGPIN"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/tcomm.2020.2975195","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T22:02:25Z","timestamp":1582236145000},"page":"2667-2679","source":"Crossref","is-referenced-by-count":12,"title":["Error Floor Estimation of LDPC Decoders \u2014 A Code Independent Approach to Measuring the Harmfulness of Trapping Sets"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9279-6066","authenticated-orcid":false,"given":"Ali","family":"Farsiabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-5256","authenticated-orcid":false,"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887060"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2708088"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394825"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910589"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.836563"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799627"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334657"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.071813.120659"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.042712.100672"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.111113.131881"},{"article-title":"Studies on graph–based coding systems","year":"2004","author":"sun","key":"ref2"},{"key":"ref1","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":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173733"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2933828"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2679707"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2953601"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2955450"},{"key":"ref26","first-page":"277","article-title":"LDPC decoder strategies for achieving low error floors","author":"han","year":"2008","journal-title":"Proc Inf Theory Appl Workshop"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651870"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188272"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907485"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.046112"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2363832"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/9781119106319"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2010.2040026"},{"key":"ref13","first-page":"41","article-title":"A heuristic search for good low-density parity-check codes at short block lengths","volume":"1","author":"mao","year":"2001","journal-title":"Proc IEEE Int Conf Commun Conf Rec"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.083110.080638"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.060112.120844"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.0700712"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313074"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090809"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.07.050060"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.122112.110805"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048448"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2498161"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2331070"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"year":"0","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179842"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/4234.1001666"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"2019","author":"mackay","key":"ref44"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9094270\/09005250.pdf?arnumber=9005250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:47:15Z","timestamp":1651067235000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9005250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":53,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.2975195","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}