{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:13:32Z","timestamp":1790183612057,"version":"4.1.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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,1]]},"DOI":"10.1109\/tit.2009.2034798","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T16:40:32Z","timestamp":1262882432000},"page":"152-167","source":"Crossref","is-referenced-by-count":21,"title":["Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat\u2013Accumulate Codes"],"prefix":"10.1109","volume":"56","author":[{"given":"Mao-Ching","family":"Chiu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"},{"key":"ref38","first-page":"24","article-title":"joint commsoc\/it paper award: accumulate-repeat-accumulate codes","volume":"58","author":"abbasfar","year":"2008","journal-title":"IEEE Inf Theory Soc Newslett"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2003.808600"},{"key":"ref32","author":"davey","year":"1999","journal-title":"Error-correction using low-density parity-check codes"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref30","first-page":"2882","article-title":"a nonbinary extension of ra codes: weighted nonbinary repeat accumulate codes","author":"yang","year":"2003","journal-title":"Proc 14th IEEE Int Symp Personal Indoor Mobile Radio Commun"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.821995"},{"key":"ref35","first-page":"1063","article-title":"an efficient decoding algorithm for cycle-free convolutional codes and its applications","author":"li","year":"2001","journal-title":"Proc IEEE Global Commun Conf"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003830"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815777"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref15","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":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.119687"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"ref19","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TCOMM.2004.840630","article-title":"serial concatenated tcm with an inner accumulate codepart i: maximum-likelihood analysis","volume":"53","author":"tullberg","year":"2005","journal-title":"IEEE Trans Inf Theory"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-60693-9_13","author":"mackay","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023443"},{"key":"ref3","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841986"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref8","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910580"},{"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":"ref20","first-page":"1","article-title":"are turbo-codes effective on non standard channels?","volume":"51","author":"mceliece","year":"2001","journal-title":"IEEE Inf Theory Soc Newslett"},{"key":"ref22","first-page":"70","article-title":"turbo codes with nonuniform qam constellations","volume":"1","author":"fragouli","year":"2001","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.259663"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828101"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826367"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896873"},{"key":"ref23","first-page":"1","article-title":"irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes Related Topics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831778"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811907"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5361455\/05361483.pdf?arnumber=5361483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T15:25:13Z","timestamp":1711121113000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5361483\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":42,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2034798","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}