{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:01:20Z","timestamp":1761663680561,"version":"3.37.3"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC Discovery","doi-asserted-by":"publisher","award":["217239-2013-RGPIN"],"award-info":[{"award-number":["217239-2013-RGPIN"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1109\/lcomm.2017.2767028","type":"journal-article","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T20:29:17Z","timestamp":1509568157000},"page":"33-36","source":"Crossref","is-referenced-by-count":7,"title":["Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes"],"prefix":"10.1109","volume":"22","author":[{"given":"Yoones","family":"Hashemi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-5256","authenticated-orcid":false,"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2617335"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2009.5307322"},{"year":"2006","key":"ref14"},{"journal-title":"ATSC Candidate Standard Physical Layer Protocol","year":"2017","key":"ref15"},{"journal-title":"MAGMA Software","year":"2017","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2171531"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523730"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595332"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.090164"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2707553"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006717"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref9","article-title":"On the Tanner graph cycle distribution of random LDPC, random protograph-based LDPC, and random quasi-cyclic LDPC code ensembles","author":"dehghan","year":"0","journal-title":"IEEE Trans Inf Theory"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8249516\/08093638.pdf?arnumber=8093638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T21:05:59Z","timestamp":1643144759000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8093638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":17,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2017.2767028","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}