{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:15Z","timestamp":1772283435235,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875275","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"2454-2458","source":"Crossref","is-referenced-by-count":8,"title":["Quasi-cyclic LDPC codes on two arbitrary sets of a finite field"],"prefix":"10.1109","author":[{"given":"Juane","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keke","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"10","first-page":"995","article-title":"Progressive edge-growth tanner graphs","author":"hu","year":"2001","journal-title":"Proc IEEE Globecom"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184834"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.090721"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/26.990903","article-title":"Near optimum universal belief propagation based decoding of low-density parity-check codes","volume":"50","author":"chen","year":"2002","journal-title":"IEEE Trans Inform Theory"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.020212.112311"},{"key":"11","doi-asserted-by":"crossref","first-page":"4816","DOI":"10.1109\/TCOMM.2013.091213.120791","article-title":"A revolving iterative algorithm for decoding algebraic cyclic and quasi-cyclic ldpc codes","volume":"61","author":"lin","year":"2013","journal-title":"IEEE Trans Commun"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2004.826194"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875275.pdf?arnumber=6875275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T02:08:34Z","timestamp":1649988514000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875275","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}