{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:34:31Z","timestamp":1725464071570},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/glocom.2005.1577844","type":"proceedings-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T16:24:16Z","timestamp":1138206256000},"page":"6 pp.","source":"Crossref","is-referenced-by-count":1,"title":["Efficient encoding of quasi-cyclic low-density parity-check codes"],"prefix":"10.1109","author":[{"family":"Zongwang Li","sequence":"first","affiliation":[]},{"family":"Lei Chen","sequence":"additional","affiliation":[]},{"family":"Lingqi Zeng","sequence":"additional","affiliation":[]},{"family":"Shu Lin","sequence":"additional","affiliation":[]},{"family":"Wai Fong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/GLOCOM.2003.1258979"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/SECON.1989.132413"},{"year":"2001","author":"gray","journal-title":"Toeplitz and circulant matrices A review","key":"12"},{"key":"3","first-page":"239","article-title":"Construction of QC-LDPC codes based on the minimum-weight codewords of RS codes","author":"chen","year":"2004","journal-title":"Proc IEEE Int Symp Inform Theory"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/TIT.2004.828088"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/TCOMM.2004.831353"},{"year":"0","key":"10"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/18.910579"},{"key":"6","first-page":"226","article-title":"Spectral graphs for quasi-cyclic LDPC codes","author":"tanner","year":"2001","journal-title":"Proc IEEE Int Symp on Inform Theory"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/TCOMM.2004.841966"},{"key":"4","first-page":"535","article-title":"An algebraic methode for constructing quasi-cyclic LDPC codes","author":"chen","year":"2004","journal-title":"Proc Int Symp Inform Theory and its Applications"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/18.959255"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/TIT.1981.1056404"}],"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\/01577844.pdf?arnumber=1577844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T15:25:46Z","timestamp":1489505146000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1577844\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/glocom.2005.1577844","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}