{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:26:21Z","timestamp":1767979581282,"version":"3.49.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/ita.2014.6804221","type":"proceedings-article","created":{"date-parts":[[2014,5,6]],"date-time":"2014-05-06T00:57:08Z","timestamp":1399337828000},"page":"1-10","source":"Crossref","is-referenced-by-count":20,"title":["Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure"],"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":"15","first-page":"995","article-title":"Progressive edge-growth Tanner graphs","author":"hu","year":"2001","journal-title":"Proc IEEE Globecom"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887082"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280640"},{"key":"12","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":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.020212.112311"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.0901.060129"},{"key":"6","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":"liu","year":"2013","journal-title":"IEEE Trans Commun"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620708"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2004.826194"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184834"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"}],"event":{"name":"2014 Information Theory and Applications Workshop (ITA)","location":"San Diego, CA, USA","start":{"date-parts":[[2014,2,9]]},"end":{"date-parts":[[2014,2,14]]}},"container-title":["2014 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6799451\/6804199\/06804221.pdf?arnumber=6804221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:57:08Z","timestamp":1648958228000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6804221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ita.2014.6804221","relation":{},"subject":[],"published":{"date-parts":[[2014,2]]}}}