{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:28Z","timestamp":1774990768323,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541754","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2524-2528","source":"Crossref","is-referenced-by-count":0,"title":["Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes"],"prefix":"10.1109","author":[{"given":"Yoones","family":"Hashemi","sequence":"first","affiliation":[{"name":"Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada"}]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[{"name":"Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada"}]}],"member":"263","reference":[{"key":"ref4","article-title":"New characterization and efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","author":"hashemi","year":"0","journal-title":"submitted to IEEE Trans Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2390648"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173733"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334657"},{"key":"ref11","first-page":"365","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"0","journal-title":"Proc Int Symp Commun Theory Appl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.071813.120659"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.042712.100672"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref9","article-title":"Encyclopedia of sparse graph codes","author":"mackay","year":"0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454095"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541754.pdf?arnumber=7541754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:32Z","timestamp":1774986692000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541754\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541754","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}