{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:28:55Z","timestamp":1778783335225,"version":"3.51.4"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/tit.2009.2025573","type":"journal-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:00:35Z","timestamp":1251126035000},"page":"4167-4178","source":"Crossref","is-referenced-by-count":47,"title":["An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices"],"prefix":"10.1109","volume":"55","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d8yvind","family":"Ytrehus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261897"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref37","first-page":"248","article-title":"construction of ldpc codes based on ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2000","journal-title":"Proc 38th Annu Allerton Conf Communication Control and Computing"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref35","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"ref34","article-title":"a class of group-structured ldpc codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Communication Theory and Applications (ISCTA)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907496"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/49.924874"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523542"},{"key":"ref2","first-page":"100","article-title":"good codes based on very sparse matrices","volume":"1025","author":"mackay","year":"1995","journal-title":"Proc 5th IMA Conf Cryptography and Coding (Lecture Notes in Computer Science)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","first-page":"767","article-title":"on the computation of the minimum distance of low-density parity-check codes","volume":"2","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Communications (ICC)"},{"key":"ref22","article-title":"a probabilistic subspace approach to the minimal stopping set problem","author":"hu","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes and Related Topics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523730"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595332"},{"key":"ref23","article-title":"finding small stopping sets in the tanner graphs of ldpc codes","author":"richter","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes and Related Topics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594995"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2008.4578623"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.832776"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892812"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261869"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577850"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/4234.781010"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref10","first-page":"1426","article-title":"error floors of ldpc codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Communication Control and Computing"},{"key":"ref11","article-title":"graph-cover decoding and finite-length analysis of message-passing iterative decoding of ldpc codes","author":"vontobel","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261777"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896864"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"ref17","first-page":"69","article-title":"hardness of approximation results for the problem of finding the stopping distance in tanner graphs","volume":"4337","author":"krishnan","year":"2006","journal-title":"Proc 26th Int Conf Foundations of Software Technology and Theoretical Computer Science (Lecture Notes in Computer Science)"},{"key":"ref18","first-page":"248","article-title":"on the hardness of approximating stopping and trapping sets in ldpc codes","author":"mcgregor","year":"2007","journal-title":"Proc IEEE Information Theory Workshop"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313082"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref5","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 Communications (ICC)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261678"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.827977"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883542"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887513"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1576590"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261947"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.817545"},{"key":"ref41","year":"2006","journal-title":"IEEE Standard for Local and Metropolitan Area Networks Part 16 Air Interface for Fixed and Mobile Broadband Wireless Access Systems Amendment 2 Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands and Corrigendum 1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.2004.1363033"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5208468\/05208476.pdf?arnumber=5208476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:05Z","timestamp":1633909865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5208476\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":56,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2025573","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}