{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:43:18Z","timestamp":1730274198487,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557664","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T00:17:12Z","timestamp":1215562632000},"page":"2936-2940","source":"Crossref","is-referenced-by-count":13,"title":["An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices"],"prefix":"10.1109","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oyvind","family":"Ytrehus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261777"},{"key":"ref10","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annual Allerton Conf on Commun 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":"2005","journal-title":"IEEE Trans Inform Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"article-title":"On the complexity of finding stopping distance in Tanner graphs","year":"2005","author":"krishnan","key":"ref14"},{"key":"ref15","article-title":"Exhausting error-prone patterns in LDPC codes","author":"wang","year":"2006","journal-title":"IEEE Trans Inform Theory submitted for publication"},{"key":"ref16","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 Commun (ICC)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523730"},{"key":"ref18","article-title":"A probabilistic subspace approach to the minimal stopping set problem","author":"hu","year":"2006","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"key":"ref19","article-title":"Finding small stopping sets in the Tanner graphs of LDPC codes","author":"richter","year":"2006","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"key":"ref28","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"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"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 Commun (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":"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 on Cryptography and Coding (Lecture Notes in Computer Science)"},{"key":"ref9","article-title":"Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes","volume":"74","author":"mackay","year":"2002","journal-title":"Proc Second Irish Conf Mathematical Foundations of Computer Science and InformationTechnology (ElectronicNotes in Theoretical Computer Science)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/49.924874"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523542"},{"key":"ref21","article-title":"Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets","author":"rosnes","year":"2006","journal-title":"IEEE Trans Inform Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref26"},{"key":"ref25","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557664.pdf?arnumber=4557664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T12:54:10Z","timestamp":1489668850000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557664\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557664","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}