{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:48:25Z","timestamp":1729633705253,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557663","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T04:17:12Z","timestamp":1215577032000},"page":"2931-2935","source":"Crossref","is-referenced-by-count":1,"title":["Average Stopping Set Weight Distribution of Redundant Random Matrix Ensembles"],"prefix":"10.1109","author":[{"given":"Tadashi","family":"Wadayama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883619"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref4","article-title":"On parity-check matrices with optimal stopping and\/or dead-end set enumerators","author":"abdel-ghaffar","year":"2006","journal-title":"Proceedings of Turbo-coding 2006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref5","article-title":"On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size","author":"hollmann","year":"2005","journal-title":"arXiv cs IT"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low density parity check codes","author":"gallager","year":"1963"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842571"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557663.pdf?arnumber=4557663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:12:56Z","timestamp":1557673976000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557663","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}