{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T20:14:28Z","timestamp":1791144868247,"version":"4.1.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282491","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"431-435","source":"Crossref","is-referenced-by-count":15,"title":["On the girth of (3,L) quasi-cyclic LDPC codes based on complete protographs"],"prefix":"10.1109","author":[{"given":"Sudarsan V. S.","family":"Ranganathan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dariush","family":"Divsalar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard D.","family":"Wesel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","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 & Related Topics"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198570431.001.0001","author":"matousek","year":"2008","journal-title":"Invitation to Discrete Mathematics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08842-X"},{"key":"ref13","article-title":"The On-Line Encyclopedia of Integer Sequences","author":"sloane","year":"0","journal-title":"Number of Complete Mappings of The Cyclic Group Z2n+1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282491"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251395"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-Density Parity-Check Codes","author":"gallager","year":"1963"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874925"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658694"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279831"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref1","first-page":"42","article-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs","author":"thorpe","year":"2003","journal-title":"JPL IPN-PR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","location":"Hong Kong, Hong Kong","start":{"date-parts":[[2015,6,14]]},"end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282491.pdf?arnumber=7282491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T14:22:53Z","timestamp":1718115773000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282491\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282491","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}