{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:33:22Z","timestamp":1763642002956,"version":"3.28.0"},"reference-count":50,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/ita.2015.7308964","type":"proceedings-article","created":{"date-parts":[[2015,10,29]],"date-time":"2015-10-29T22:04:22Z","timestamp":1446156262000},"page":"36-45","source":"Crossref","is-referenced-by-count":18,"title":["An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation"],"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"}]},{"given":"William E.","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261868"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577834"},{"key":"ref33","article-title":"Reduced-complexity iterative scheme for decoidng quasi-cyclic low-density parity-check codes","author":"lin","year":"2014","journal-title":"Asilomar Conf on Signals Syst Comput"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2014.6955082"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2339329"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184834"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523619"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090806"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"ref34","first-page":"42","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2003","journal-title":"Jet Propulsion Lab Pasadena CA IPN Progress Report"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179842"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref29","first-page":"1","article-title":"A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes","author":"diao","year":"2011","journal-title":"Proc Inf Theory Applicat Workshop (ITA)"},{"key":"ref2","article-title":"Progressive edge-growth Tanner graphs","author":"hu","year":"0","journal-title":"Proc IEEE Globecom"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.0901.060129"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.090721"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.05.090211"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.881361"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.060911.100208"},{"journal-title":"Error Control Coding Fundamentals and Applications","year":"2004","author":"lin","key":"ref26"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TCOMM.2008.050483","article-title":"New construction of quasi-cyclic LDPC codes based on special classes of BIBDs for the AWGN and binary erasure channel","volume":"56","author":"lan","year":"2008","journal-title":"IEEE Trans Inf Theory"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref10","first-page":"6","article-title":"On products of graphs for LDPC codes","author":"xu","year":"2003","journal-title":"Proc IEEE Information Theory Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228044"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831353"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841966"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840867"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887082"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref4","first-page":"200","article-title":"Low density parity check codes based on finite geometries: A rediscovery","author":"kou","year":"2000","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref6","first-page":"543","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes &amp Related Topics"},{"key":"ref5","first-page":"137","article-title":"Construction of low density parity check codes: A geometric approach","author":"kou","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes &amp Related Topics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2000.891254"},{"journal-title":"Low Density Parity Check Codes for Use in Near-earth and Deep Space Applications Standard CCSDS","first-page":"131.1","year":"2007","key":"ref49"},{"key":"ref9","first-page":"1149","article-title":"Hybrid construction of LDPC codes","author":"lin","year":"2002","journal-title":"Proc 40th Allerton Conf Communication Control and Computers"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316215"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2342735"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.091213.120791"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804221"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513638"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454136"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.081012.110010"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094819"}],"event":{"name":"2015 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2015,2,1]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2015,2,6]]}},"container-title":["2015 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7152136\/7308952\/07308964.pdf?arnumber=7308964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T17:42:34Z","timestamp":1692121354000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7308964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/ita.2015.7308964","relation":{},"subject":[],"published":{"date-parts":[[2015,2]]}}}