{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:35:25Z","timestamp":1729658125533,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/itw.2012.6404658","type":"proceedings-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T15:30:12Z","timestamp":1358436612000},"page":"202-206","source":"Crossref","is-referenced-by-count":2,"title":["Constructing good QC-LDPC codes by pre-lifting protographs"],"prefix":"10.1109","author":[{"given":"D. G. M.","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Smarandache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5963333"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-1-4613-0165-3_6","article-title":"Evaluation of gallager codes for short block length and high rate applications","author":"mackay","year":"2001","journal-title":"Codes Systems and Graphical Models IMA Volumes in Mathematics and Its Applications"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089477"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840867"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"journal-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs","year":"2003","author":"thorpe","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.060911.100208"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.090721"},{"key":"5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TCOMM.2005.861667","article-title":"Efficient encoding of quasi-cyclic low-density parity-check codes","volume":"54","author":"li","year":"2006","journal-title":"IEEE Tram Commun"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851753"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831353"}],"event":{"name":"2012 IEEE Information Theory Workshop (ITW 2012)","start":{"date-parts":[[2012,9,3]]},"location":"Lausanne","end":{"date-parts":[[2012,9,7]]}},"container-title":["2012 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6389798\/6404631\/06404658.pdf?arnumber=6404658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T01:50:58Z","timestamp":1498009858000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6404658\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2012.6404658","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}