{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:53:37Z","timestamp":1766066017786},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"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":[[2010,10]]},"DOI":"10.1109\/tit.2010.2059910","type":"journal-article","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T21:13:01Z","timestamp":1284585181000},"page":"5314-5334","source":"Crossref","is-referenced-by-count":19,"title":["Nonbinary Hybrid LDPC Codes"],"prefix":"10.1109","volume":"56","author":[{"given":"Lucile","family":"Sassatelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Declercq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.890694"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060527"},{"key":"ref31","article-title":"design of ldpc codes: a survey and new results","author":"liva","year":"2006","journal-title":"J Commun Softw Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.071843"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1109\/GLOCOM.2005.1577834","article-title":"protograph based ldpc codes with minimum distance linearly growing with block size","volume":"3","author":"divsalar","year":"2005","journal-title":"Proc IEEE Global Telecommun Conf"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.212301"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.782170"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254909"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965566"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883541"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref14","first-page":"13","article-title":"analysis of doubly-generalized ldpc codes with random component codes for the binary erasure channel","author":"paolini","year":"2006","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref15","author":"andriyanova","year":"2006","journal-title":"Analysis and design of a certain family of graph-based codes TLDPC"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref17","author":"davey","year":"1999","journal-title":"Error-correction using low-density parity-check codes"},{"key":"ref18","first-page":"528","article-title":"binary representation of cycle tanner-graph gf <formula formulatype=\"inline\"><tex notation=\"tex\">$(2^{q})$<\/tex> <\/formula> codes","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"ref28","first-page":"234","article-title":"analysis of nonbinary ldpc codes using gaussian approximation","author":"li","year":"2003","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.910580"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref7","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref46","first-page":"1377","article-title":"low-rate generalized ldpc codes with hadamard constraints","author":"yue","year":"2005","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894089"},{"key":"ref45","author":"richardson","year":"2008","journal-title":"Review of This Paper"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323784"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2002.1115443"},{"key":"ref42","first-page":"218","article-title":"improvements and extensions of low-rate turbo-hadamard codes","author":"shimanuki","year":"2006","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref24","first-page":"2435","article-title":"detailedly represented irregular ldpc codes","volume":"e86 a","author":"kasai","year":"2003","journal-title":"IEICE Trans Fund"},{"key":"ref41","first-page":"79","author":"bosco","year":"2004","journal-title":"Springer USOptical Communication Theory and Techniques"},{"key":"ref23","author":"paolini","year":"2007","journal-title":"Iterative Decoding Methods Based on Low-Density Graphs"},{"key":"ref44","first-page":"767","article-title":"on the computation of the minimum distance of low-density parity-check codes","volume":"2","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.115"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050600"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5571829\/05571892.pdf?arnumber=5571892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:44:11Z","timestamp":1633913051000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5571892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":46,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2059910","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}