{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T20:14:27Z","timestamp":1791144867835,"version":"4.1.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"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":[[2010,4]]},"DOI":"10.1109\/tit.2010.2040962","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T19:51:52Z","timestamp":1269460312000},"page":"1600-1611","source":"Crossref","is-referenced-by-count":36,"title":["On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes"],"prefix":"10.1109","volume":"56","author":[{"given":"S.K.","family":"Chilappagari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Dung Viet Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Vasic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.W.","family":"Marcellin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003853"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-003-0098-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577850"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BFb0054322","article-title":"spectral techniques in graph algorithms","author":"alon","year":"1998","journal-title":"LATIN '98 Proc Third Latin American Symposium on Theoretical Informatics"},{"key":"ref14","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 Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023274"},{"key":"ref16","author":"biggs","year":"1993","journal-title":"Algebraic Graph Theory"},{"key":"ref17","first-page":"1426","article-title":"error floors of ldpc codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Commun Contr Comput"},{"key":"ref18","article-title":"graph-cover decoding and finite-length analysis of message-passing iterative decoding of ldpc codes","author":"vontobel","year":"2007","journal-title":"IEEE Trans Inf Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261869"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref27","first-page":"249","article-title":"extremal graphs without three-cycles, four-cycles or five-cycles","volume":"66","author":"yuansheng","year":"2004","journal-title":"Utilitas Mathematica"},{"key":"ref3","first-page":"18","article-title":"estimation of the error-correction complexity for gallager low-density codes","volume":"11","author":"zyablov","year":"1976","journal-title":"Probl Inf Transm"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910588"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913261"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910593"},{"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":"ref20","author":"bollobas","year":"1978","journal-title":"Extremal Graph Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015990"},{"key":"ref24","author":"weisstein","year":"0","journal-title":"Cage graph"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200002"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170511"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060103"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5437371\/05437420.pdf?arnumber=5437420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:37:02Z","timestamp":1633916222000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5437420\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":28,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2040962","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}