{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T16:08:41Z","timestamp":1770134921863,"version":"3.49.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523730","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"2166-2170","source":"Crossref","is-referenced-by-count":20,"title":["A probabilistic computation method for the weight distribution of low-density parity-check codes"],"prefix":"10.1109","author":[{"given":"M.","family":"Hirotomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Morii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"14","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.21270"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.782147"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"10","author":"tissieres","year":"2004","journal-title":"Exploring Algorithms for Finding Low-weight Codewords"},{"key":"7","first-page":"475","article-title":"Approximate algorithms for computing the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Intl Symp Inform Theory Chicago USA"},{"key":"6","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":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/49.924874"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023277"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","location":"Adelaide, Australia","start":{"date-parts":[[2005,9,4]]},"end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523730.pdf?arnumber=1523730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T14:45:04Z","timestamp":1587221104000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523730\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523730","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}