{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:02:35Z","timestamp":1732032155744,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523619","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1622-1626","source":"Crossref","is-referenced-by-count":61,"title":["Low-rate LDPC codes with simple protograph structure"],"prefix":"10.1109","author":[{"given":"D.","family":"Divsalar","sequence":"first","affiliation":[]},{"given":"S.","family":"Dolinar","sequence":"additional","affiliation":[]},{"given":"C.","family":"Jones","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365073"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.612925"},{"journal-title":"Multi-Edge Type LDPC Codes","year":"0","author":"richardson","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365542"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1222727"},{"key":"21","first-page":"995","article-title":"Progressive edge-growth Tanner graphs","volume":"2","author":"arnold","year":"2001","journal-title":"Proc 2001 Global Telecommunications Conf"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365107"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"journal-title":"Low Density Parity Check Codes","year":"1963","author":"gallager","key":"1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1222728"},{"key":"7","article-title":"Low Density Parity Check (LDPC) codes constructed from protographs","volume":"42","author":"thorpe","year":"2003","journal-title":"JPL INP Progress Report"},{"key":"6","first-page":"1","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc 2nd International Symposium on Turbo Codes"},{"key":"5","first-page":"201","article-title":"Coding theorems for Turbo-like codes","author":"divsalar","year":"1998","journal-title":"Proceedings of the 1998 Allerton Conference"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"year":"0","author":"richards","key":"8"}],"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\/01523619.pdf?arnumber=1523619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T16:43:34Z","timestamp":1555865014000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523619\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523619","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}