{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T01:44:14Z","timestamp":1725414254375},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523591","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1488-1492","source":"Crossref","is-referenced-by-count":10,"title":["Complexity-optimized low-density parity-check codes for gallager decoding algorithm B"],"prefix":"10.1109","author":[{"family":"Wei Yu","sequence":"first","affiliation":[]},{"given":"M.","family":"Ardakani","sequence":"additional","affiliation":[]},{"given":"B.","family":"Smith","sequence":"additional","affiliation":[]},{"given":"F.","family":"Kschischang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-46796-3_7","article-title":"New sequence of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proc Symp Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"7","first-page":"1","article-title":"On the complexity of reliable communication on the erasure channel","author":"khandekar","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1375239"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828101"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.838718"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","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\/01523591.pdf?arnumber=1523591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T16:43:28Z","timestamp":1555865008000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523591","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}