{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:09:50Z","timestamp":1761718190524,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034147","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"366-370","source":"Crossref","is-referenced-by-count":5,"title":["A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes"],"prefix":"10.1109","author":[{"given":"Qiuju","family":"Diao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.808375"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090803"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.05.090211"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","article-title":"Quasi-cyclic low-density parity-check codes with girth larger than 12","volume":"53","author":"kim","year":"2007","journal-title":"IEEE Trans Inform Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050483"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"journal-title":"Error Correcting Coding Fundamentals and Applications","year":"2004","author":"lin","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1506715"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060024"},{"key":"ref4","first-page":"545","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc Int Symp Turbo Codes"},{"key":"ref27","first-page":"365","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory and Appl (ISCTA)"},{"key":"ref3","article-title":"A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes","author":"diao","year":"2011","journal-title":"Inf Theory Appl Workshop (ITA)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.090721"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"journal-title":"An Introduction to the Theory of Numbers","year":"1979","author":"hardy","key":"ref8"},{"journal-title":"Toeplitz and Circulant Matri-ces A Review","year":"1993","author":"gray","key":"ref7"},{"journal-title":"Theory and Practice of Error Control Codes","year":"1983","author":"blahut","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080065"},{"journal-title":"Algebraic Coding Theory","year":"1968","author":"berlekamp","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851753"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.881361"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.0901.060129"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.936089"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.9772"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034147.pdf?arnumber=6034147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:35:39Z","timestamp":1497929739000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034147","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}