{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:57Z","timestamp":1725536937166},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034146","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"361-365","source":"Crossref","is-referenced-by-count":0,"title":["A reliability-based computation method for the weight distribution of LDPC codes using the probabilistic algorithm"],"prefix":"10.1109","author":[{"given":"Masanori","family":"Hirotomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masami","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakatu","family":"Morii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523730"},{"key":"ref11","first-page":"735","article-title":"New probabilistic algorithm to enhance the reliability of computed weight distribution of LDPC codes","author":"hirotomo","year":"2006","journal-title":"Proc 2006 Intl Symp Inform Theory and Its Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref6","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"IEEE Intl Conf Commun"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/49.924874"},{"key":"ref7","first-page":"1017","article-title":"Computing the minimum distance of linear codes by the error impulse method","author":"berrou","year":"2002","journal-title":"Proc IEEE Global Telecommun Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1091"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034146.pdf?arnumber=6034146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T16:59:38Z","timestamp":1593104378000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034146\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034146","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}