{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T05:25:42Z","timestamp":1725427542485},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/glocom.2005.1577831","type":"proceedings-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T16:24:16Z","timestamp":1138206256000},"page":"5 pp.","source":"Crossref","is-referenced-by-count":0,"title":["Generalized quad, hex, and octagon LDPC codes"],"prefix":"10.1109","author":[{"family":"Zhenyu Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.A.","family":"Pados","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/18.9772"},{"year":"0","key":"17"},{"article-title":"Algebraic coding for iterative decoding","year":"2003","author":"vontobel","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910591"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00181262"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00150760"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01109836"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/26.990903"},{"journal-title":"Source code for progressive edge growth parity-check","year":"0","author":"hu","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"journal-title":"LDPCopt An Efficient Optimization Program for LDPC Codes","year":"0","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00181609"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(64)90028-6"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0271-0"},{"key":"8","first-page":"223","article-title":"Construction of codes based on finite generalized quadrangles for iterative decoding","author":"vontobel","year":"2001","journal-title":"Proc IEEE Intern Symp on Inform Theory"}],"event":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","start":{"date-parts":[[2005,12,2]]},"location":"St. Louis, MO, USA","end":{"date-parts":[[2005,12,2]]}},"container-title":["GLOBECOM '05. IEEE Global Telecommunications Conference, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10511\/33287\/01577831.pdf?arnumber=1577831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T15:39:13Z","timestamp":1489505953000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1577831\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/glocom.2005.1577831","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}