{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:10:25Z","timestamp":1725538225658},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437485","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1645-1649","source":"Crossref","is-referenced-by-count":2,"title":["Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard"],"prefix":"10.1109","author":[{"given":"Ali","family":"Dehghan","sequence":"first","affiliation":[]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006717"},{"key":"ref10","article-title":"Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes","author":"dehghan","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910589"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2363832"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0047-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334657"}],"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\/08437485.pdf?arnumber=8437485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:09:46Z","timestamp":1598227786000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437485\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437485","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}