{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:51:49Z","timestamp":1755219109640,"version":"3.43.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437769","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1635-1639","source":"Crossref","is-referenced-by-count":0,"title":["Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets"],"prefix":"10.1109","author":[{"given":"Yoones","family":"Hashemi","sequence":"first","affiliation":[]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2617335"},{"key":"ref11","first-page":"1","article-title":"Efficient algorithms to find all small error-prone substructures in LDPC codes","author":"zhang","year":"2011","journal-title":"Proc Global Telecommun Conf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2009.5307322"},{"year":"0","key":"ref13"},{"key":"ref4","article-title":"Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets","author":"hashemi","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2707553"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref6"},{"key":"ref5","first-page":"295","article-title":"On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes","author":"hirotomo","year":"2008","journal-title":"Proc ISIT"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2171531"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025573"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006717"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref9","first-page":"365","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437769.pdf?arnumber=8437769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:11Z","timestamp":1754502971000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437769","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}