{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T05:18:39Z","timestamp":1715404719944},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1109\/tcomm.2004.841966","type":"journal-article","created":{"date-parts":[[2005,3,7]],"date-time":"2005-03-07T13:32:05Z","timestamp":1110202325000},"page":"243-251","source":"Crossref","is-referenced-by-count":65,"title":["Construction of Low-Density Parity-Check Codes by Superposition"],"prefix":"10.1109","volume":"53","author":[{"given":"J.","family":"Xu","sequence":"first","affiliation":[]},{"given":"L.","family":"Chen","sequence":"additional","affiliation":[]},{"given":"L.","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"L.","family":"Lan","sequence":"additional","affiliation":[]},{"given":"S.","family":"Lin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1149","article-title":"hybrid construction of ldpc codes","author":"lin","year":"2002","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref11","first-page":"1024","article-title":"explicit construction of families of ldpc codes with girth at least six","author":"kim","year":"2002","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.808375"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228044"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267048"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831353"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828088"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828144"},{"key":"ref28","first-page":"4","article-title":"constructions of ldpc codes using ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2001","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref27","author":"mann","year":"1949","journal-title":"Analysis and Design of Experiments"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref8","first-page":"248","article-title":"constructions of ldpc codes using ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2000","journal-title":"Proc 20th Allerton Conf Comm Control and Computing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref9","first-page":"365","article-title":"a class of group-structured ldpc codes","author":"tanner","year":"2001","journal-title":"Proc 6th Int Symp Commun Theory Applicat"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.827431"},{"key":"ref22","author":"lin","year":"2004","journal-title":"Error Control Coding Fundamentals and Applications"},{"key":"ref21","article-title":"efficient encoding of quasi-cyclic ldpc codes","author":"li","year":"0","journal-title":"IEEE Trans Commun"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","author":"bondy","year":"1976","journal-title":"Graph Theory with Applications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057464"},{"key":"ref25","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/30453\/01402646.pdf?arnumber=1402646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:41:25Z","timestamp":1638200485000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1402646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,2]]}},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2004.841966","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}