{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:28Z","timestamp":1730274688311,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523620","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"1627-1631","source":"Crossref","is-referenced-by-count":20,"title":["A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening"],"prefix":"10.1109","author":[{"given":"S.","family":"Dolinar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","article-title":"Low-density Parity-check (LDPC) codes constructed from protographs","volume":"42","author":"thorpe","year":"2003","journal-title":"IPN Progress Report"},{"year":"0","author":"richards","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365542"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.0901.060256"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"5","first-page":"995","article-title":"Progressive edge-growth Tanner graphs","author":"arnold","year":"2001","journal-title":"Global Telecommunications Conference 2001"},{"key":"4","article-title":"Low density parity check codes: Bandwidth efficient channel coding","author":"fong","year":"2003","journal-title":"Nasa Earth Science Technology Conference 2003"},{"key":"9","article-title":"Analysis and design of punctured LDPCCs over Gaussian channel with erasures","author":"ha","year":"2002","journal-title":"IEEE International Symposium on Information Theory"},{"key":"8","article-title":"Rate-compatible low-density parity-check codes","author":"tian","year":"2004","journal-title":"IEEE International Symposium on Information Theory"}],"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\/01523620.pdf?arnumber=1523620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T17:49:23Z","timestamp":1489600163000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523620\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523620","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}