{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T16:13:43Z","timestamp":1776528823268,"version":"3.51.2"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/milcom.2011.6127733","type":"proceedings-article","created":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T11:34:31Z","timestamp":1330601671000},"page":"566-571","source":"Crossref","is-referenced-by-count":5,"title":["EXIT chart analysis and design of non-binary protograph-based LDPC codes"],"prefix":"10.1109","author":[{"family":"Ben-Yue Chang","sequence":"first","affiliation":[]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[]},{"given":"Dariush","family":"Divsalar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","article-title":"Low-Density Parity-Check (LDPC) Codes Constructed from Protographs","author":"thorpe","year":"2003","journal-title":"JPL IPN Progress Report"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.259663"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"14","author":"richardson","year":"0","journal-title":"Multi-Edge Type LDPC Codes"},{"key":"11","article-title":"Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over double-struck Fq","author":"liva","year":"0","journal-title":"IEEE Inter Conf on Comm (ICC) Kyoto Japan June 2011"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060527"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity Check Codes"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090806"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2011.2162259","article-title":"Multiplicatively Repeated Non-Binary LDPC Codes","author":"kasai","year":"2011","journal-title":"IEEE Trans on Info Theory"},{"key":"8","article-title":"Binary Representation of Cycle Tanner-Graph GF(2q) Codes","author":"hu","year":"0","journal-title":"IEEE Inter Conf on Comm (ICC) Paris France June 2004"}],"event":{"name":"MILCOM 2011 - 2011 IEEE Military Communications Conference","location":"Baltimore, MD, USA","start":{"date-parts":[[2011,11,7]]},"end":{"date-parts":[[2011,11,10]]}},"container-title":["2011 - MILCOM 2011 Military Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111660\/6127424\/06127733.pdf?arnumber=6127733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T10:14:14Z","timestamp":1593771254000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6127733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/milcom.2011.6127733","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}