{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:55:04Z","timestamp":1772016904514,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Jet Propulsion Laboratory, California Institute of Technology, through the National Aeronautics and Space Administration"},{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"crossref","award":["CCF-1161822 through JPL Task Plan 82-17473"],"award-info":[{"award-number":["CCF-1161822 through JPL Task Plan 82-17473"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["CAREER CCF-1150212"],"award-info":[{"award-number":["CAREER CCF-1150212"]}]},{"name":"NSF","award":["CCF-1162501"],"award-info":[{"award-number":["CCF-1162501"]}]},{"name":"Advanced Storage Technology Consortium (ASTC)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/tit.2014.2316215","type":"journal-article","created":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T14:02:09Z","timestamp":1397052129000},"page":"3913-3941","source":"Crossref","is-referenced-by-count":84,"title":["Non-Binary Protograph-Based LDPC Codes: Enumerators, Analysis, and Designs"],"prefix":"10.1109","volume":"60","author":[{"given":"Lara","family":"Dolecek","sequence":"first","affiliation":[]},{"given":"Dariush","family":"Divsalar","sequence":"additional","affiliation":[]},{"given":"Yizeng","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Behzad","family":"Amiri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205687"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056380"},{"key":"ref33","first-page":"1","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proc Int Symp Turbo Codes and Rel Topics"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262072"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895508"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.05.090211"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613806"},{"key":"ref36","author":"mackay","year":"2003","journal-title":"Optimizing Sparse Graph Codes over GF(q)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.050812.110073A"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.101712.110173"},{"key":"ref62","year":"2008","journal-title":"Uplink Coding for New TC Standard Draft Orange Book"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.05.070240"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.101210.090757"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/TIT.2005.862118","article-title":"Rate-compatible punctured low-density parity-check codes with short block lengths","volume":"52","author":"ha","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094819"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"ref20","article-title":"New approaches to the analysis and design of Reed-Solomon related codes","author":"el-khamy","year":"2006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025571"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351212"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-1-4613-0165-3_13","article-title":"Iterative decoding of tail-biting trellises and connections with symbolic dynamics","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5426116"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2234207"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.03002"},{"key":"ref51","first-page":"1","article-title":"Characterization of graph-cover pseudocodewords of codes over \\(\\mathbb {F}_3\\)","author":"skachek","year":"2010","journal-title":"Proc IEEE ITW"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162642"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264715"},{"key":"ref57","author":"vontobel","year":"2005"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.05.070096"},{"key":"ref55","author":"thorpe","year":"2003","journal-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/18.259663"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.0901.060129"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658737"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091310.090327"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887060"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1004"},{"key":"ref13","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref15","author":"declercq","year":"2010","journal-title":"Performance Comparison of NB-LDPC NB-root- LDPC and NB-DGLDPC"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283973"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620780"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181802"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5569-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513596"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5425250"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205662"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"ref7","first-page":"70","article-title":"Fast decoding algorithm for LDPC codes over GF( \\(2^q\\) )","author":"barnault","year":"2003","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034183"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110930"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880065"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595129"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059910"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033702"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283931"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060527"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513602"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6832684\/06785991.pdf?arnumber=6785991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:57:10Z","timestamp":1641988630000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6785991\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":62,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2316215","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}