{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:13:04Z","timestamp":1774534384258,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595332","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:33:52Z","timestamp":1218666832000},"page":"1963-1967","source":"Crossref","is-referenced-by-count":27,"title":["Improved impulse method to evaluate the low weight profile of sparse binary linear codes"],"prefix":"10.1109","author":[{"given":"David","family":"Declercq","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Fossorier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826644"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"},{"key":"16","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1461687"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"11","article-title":"new probabilistic algorithm to enhance the reliability of computed weight distribution of ldpc codes","author":"hirotomo","year":"2006","journal-title":"Proc ISITA"},{"key":"12","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"3","article-title":"on the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Intl Conf Commun"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023277"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023277"},{"key":"10","year":"0"},{"key":"7","year":"0"},{"key":"6","year":"0"},{"key":"5","article-title":"exploring algorithms for finding low weight codewords","author":"tissieres","year":"2004"},{"key":"4","article-title":"approximate algorithms for computating the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Symp Inform Theory"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","location":"Toronto, ON, Canada","start":{"date-parts":[[2008,7,6]]},"end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595332.pdf?arnumber=4595332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T18:42:56Z","timestamp":1489689776000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595332\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595332","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}