{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:38Z","timestamp":1775054438439,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tit.2013.2251395","type":"journal-article","created":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T19:06:41Z","timestamp":1362596801000},"page":"4542-4552","source":"Crossref","is-referenced-by-count":79,"title":["On the Girth of Quasi-Cyclic Protograph LDPC Codes"],"prefix":"10.1109","volume":"59","author":[{"given":"M.","family":"Karimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. H.","family":"Banihashemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878179"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref13","author":"zhang","year":"2010","journal-title":"Girth-12 Quasi-Cyclic LDPC Codes With Consecutive Lengths"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.aeue.2008.11.013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658694"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034230"},{"key":"ref17","author":"bocharova","year":"2011","journal-title":"Searching for voltage graph-based LDPC tailbiting codes with large girth"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851753"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref4","first-page":"543","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc Int Symp Turbo Codes and Appls"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820053"},{"key":"ref3","first-page":"365","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2002.997149"},{"key":"ref5","author":"vasic","year":"2005","journal-title":"Coding and Signal Processing for Magnetic Recording Systems"},{"key":"ref8","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 Inf Theory"},{"key":"ref7","first-page":"41","article-title":"A heuristic search for good low-density parity-check codes at short block lengths","volume":"1","author":"mao","year":"2001","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862120"},{"key":"ref1","author":"thorpe","year":"2003","journal-title":"Low-density parity-check (LDPC) codes constructed from protograph"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595095"},{"key":"ref22","first-page":"1729","article-title":"On the girth of Tanner (3,5) quasi-cyclic LDPC codes","volume":"52","author":"kim","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797704"},{"key":"ref24","author":"gross","year":"1987","journal-title":"Topological Graph Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.100912.120503"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.030712.110086"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6530620\/06475181.pdf?arnumber=6475181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:45Z","timestamp":1638218865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6475181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":28,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2251395","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}