{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:22Z","timestamp":1759638562985},"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.4594995","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:33:52Z","timestamp":1218666832000},"page":"295-299","source":"Crossref","is-referenced-by-count":4,"title":["On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes"],"prefix":"10.1109","author":[{"family":"Masanori Hirotomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yoshiho Konishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Masakatu Morii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"17"},{"key":"18","first-page":"248","article-title":"construction of ldpc codes based on ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2000","journal-title":"Proc 38th Annual Allerton Conf on Communication Computing and Control"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2008.4578623"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"14","first-page":"160","article-title":"an effective method for finding the minimal stopping set of ldpc codes","author":"hirotomo","year":"2007","journal-title":"Proc 2007 Hawaii and SITA Joint Conference on Information Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557664"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523542"},{"year":"0","key":"3"},{"year":"0","key":"2"},{"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","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1091"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313082"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523728"},{"year":"0","key":"4"},{"key":"9","article-title":"finding small stopping sets in the tanner graphs of ldpc codes","author":"richer","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes and Related Topics"},{"key":"8","article-title":"a probabilistic subspace approach to the minimal stopping set problem","author":"hu","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes and Related Topics"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","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\/04594995.pdf?arnumber=4594995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T18:07:06Z","timestamp":1588874826000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4594995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4594995","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}