{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:23:32Z","timestamp":1725650612928},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523755","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"2285-2289","source":"Crossref","is-referenced-by-count":13,"title":["Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings"],"prefix":"10.1109","author":[{"given":"L.","family":"Lan","sequence":"first","affiliation":[]},{"given":"L.-Q.","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Y.Y.","family":"Tai","sequence":"additional","affiliation":[]},{"given":"S.","family":"Lin","sequence":"additional","affiliation":[]},{"given":"K.","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"239","article-title":"Construction of QC-LDPC codes based on the minimum-weight codewords of Reed-Solomon codes","author":"chen","year":"2004","journal-title":"Proc IEEE Int Symp Inform Theory"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023274"},{"key":"14","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc Allerton Conf on Communication Control and Computing"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828088"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"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.1109\/TIT.1981.1056404"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831353"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1109\/TCOMM.2005.858628","article-title":"Efficient encoding of quasi-cyclic LDPC codes","author":"li","year":"2005","journal-title":"IEEE Trans Commun"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841966"},{"key":"8","first-page":"535","article-title":"An algebraic method for constructing quasi-cyclic LDPC code","author":"chen","year":"2004","journal-title":"Proceedings of the 2004 International Symposium on Information Theory and Its Applications ISITA 2004"}],"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\/01523755.pdf?arnumber=1523755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:36Z","timestamp":1497694116000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523755\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523755","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}