{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:25:02Z","timestamp":1725546302703},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/glocom.2011.6133832","type":"proceedings-article","created":{"date-parts":[[2012,1,30]],"date-time":"2012-01-30T21:45:17Z","timestamp":1327959917000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms to Find All Small Error-Prone Substructures in LDPC Codes"],"prefix":"10.1109","author":[{"family":"Xiaojie Zhang","sequence":"first","affiliation":[]},{"given":"P. H.","family":"Siegel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"journal-title":"GNU Linear Programming Kit","year":"0","key":"18"},{"key":"15","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"0","journal-title":"Proc Int Symp Communication Theory and Applications (ISCTA) Ambleside U K Jul 2001"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513611"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025573"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454095"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"7","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":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"5","first-page":"1426","article-title":"Error-floors of LDPC codes","author":"richardson","year":"0","journal-title":"Proc of the 41st Annual Allerton Conference on Communication Control and Computing Monticello IL Oct 1-3 2003"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651870"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"}],"event":{"name":"2011 IEEE Global Communications Conference (GLOBECOM 2011)","start":{"date-parts":[[2011,12,5]]},"location":"Houston, TX, USA","end":{"date-parts":[[2011,12,9]]}},"container-title":["2011 IEEE Global Telecommunications Conference - GLOBECOM 2011"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6132211\/6133457\/06133832.pdf?arnumber=6133832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T14:47:17Z","timestamp":1490107637000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6133832\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/glocom.2011.6133832","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}