{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:13Z","timestamp":1759637953226,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513611","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"739-743","source":"Crossref","is-referenced-by-count":15,"title":["Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder"],"prefix":"10.1109","author":[{"given":"Gyu Bum","family":"Kyung","sequence":"first","affiliation":[]},{"given":"Chih-Chun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286453"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.090164"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025573"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/WIRLES.2005.1549481"},{"key":"ref16","article-title":"Improved decoding algorithms for low-density parity-check codes","author":"pishro-nik","year":"2003","journal-title":"Proc 3rd Int Symp on Turbo Codes & Related Topics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.590"},{"key":"ref18","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Int'l Conf on Commun"},{"journal-title":"Encyclopedia of Spase Graph Codes","year":"0","author":"mackay","key":"ref19"},{"key":"ref4","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf on Commun Contr and Computing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref5","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 Inform Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070325"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.900611"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite length analysis of low-density parity-check codes","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inform Theory"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651870"},{"journal-title":"ILOG CPLEX 10 0 User's Manual","year":"2007","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513611.pdf?arnumber=5513611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T23:39:05Z","timestamp":1559432345000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513611\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513611","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}