{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:45:35Z","timestamp":1730274335054,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437465","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1640-1644","source":"Crossref","is-referenced-by-count":0,"title":["From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes"],"prefix":"10.1109","author":[{"given":"Ali","family":"Dehghan","sequence":"first","affiliation":[]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579225"},{"key":"ref11","article-title":"Dynamic cage survey","author":"exoo","year":"2013","journal-title":"Electron J Combin Dynamic Survey"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-42.1.514"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref14","article-title":"From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","author":"dehghan","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01849614"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2707553"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006717"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2767028"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.37236\/4854","article-title":"Applications of integer programming methods to cages","volume":"22","author":"de ruiter","year":"2015","journal-title":"Electron J Combin"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00010-013-0227-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334657"},{"journal-title":"Biregular graphs of given degree pair and girth","year":"0","author":"exoo","key":"ref9"}],"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\/08437465.pdf?arnumber=8437465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:09:21Z","timestamp":1598242161000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437465\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437465","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}