{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:26:09Z","timestamp":1781018769425,"version":"3.54.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1109\/tit.2012.2205663","type":"journal-article","created":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T20:00:31Z","timestamp":1344024031000},"page":"6942-6958","source":"Crossref","is-referenced-by-count":88,"title":["Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes"],"prefix":"10.1109","volume":"58","author":[{"given":"Mehdi","family":"Karimi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910589"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262128"},{"key":"ref31","first-page":"365","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048448"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557558"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.071457"},{"key":"ref35","author":"vontobel","year":"0","journal-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394825"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref40","first-page":"439","article-title":"Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms","author":"xiao","year":"2008","journal-title":"Proc Int Symp Inform Theory"},{"key":"ref11","year":"2008","journal-title":"Wireless LAN Medium Access Control and Physical Layer Specifications Enhancements for Higher Throughput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008134"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WIRLES.2005.1549481"},{"key":"ref15","first-page":"75","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proc 1st Int Symp Turbo Codes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503171"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896864"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513611"},{"key":"ref19","author":"kyung","year":"0","journal-title":"private communication"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557106"},{"key":"ref4","author":"chung","year":"2000","journal-title":"On the construction of some capacity-approaching coding schemes"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651870"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313074"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025573"},{"key":"ref5","author":"cole","year":"0","journal-title":"A general method for finding low error rates of LDPC codes"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090809"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454095"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref9","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":"ref46","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"ref45","first-page":"18","article-title":"Estimates of the error-correction complexity of Gallager's low-density codes","volume":"11","author":"zyablov","year":"1976","journal-title":"Problems Inf Transm"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"ref24","first-page":"69","article-title":"Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs","author":"murali krishnan","year":"2006","journal-title":"Proc 10th Conf Foundations Software Technology and Theoretical Computer Science"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070048"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887060"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.0700712"},{"key":"ref26","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41th Annu Allerton Conf Commun Control Comput"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826367"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173733"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6331669\/06259854.pdf?arnumber=6259854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T02:20:03Z","timestamp":1510626003000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6259854\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":46,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2205663","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}