{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:08:43Z","timestamp":1649095723266},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012,1]]},"DOI":"10.1109\/tit.2011.2169540","type":"journal-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T21:58:12Z","timestamp":1326319092000},"page":"64-77","source":"Crossref","is-referenced-by-count":0,"title":["Conditionally Cycle-Free Graphical Models for Coset Codes"],"prefix":"10.1109","volume":"58","author":[{"given":"Thomas R.","family":"Halford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith M.","family":"Chugg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus T.","family":"Urie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1109\/ICC.2002.997131","article-title":"New high-rate convolutional codes for concatenated schemes","volume":"3","author":"i amat","year":"2002","journal-title":"Proc Int Conf Commun"},{"key":"ref38","first-page":"1031","article-title":"Optimal high-rate convolutional codes for partial response channels","volume":"2","author":"i amat","year":"2002","journal-title":"Proc GLOBECOM Conf"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.681330"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.661506"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057368"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.10009"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.612925"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.485713"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/26.494303"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928271"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2005.1606137"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023718"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030492"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2001.986919"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613140"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813558"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831835"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.524253"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/49.661114"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1699-6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.868484"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.21246"},{"key":"ref27","article-title":"An additive version of the SISO algorithm for the dual code","author":"montorsi","year":"2001","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.21245"},{"key":"ref6","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.817512"},{"key":"ref5","author":"vardy","year":"1999","journal-title":"Handbook of Coding Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055821"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9030"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/49.924870"},{"key":"ref22","author":"macwilliams","year":"1978","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/26.46516"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2002.1006554"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/4234.673658"},{"key":"ref41","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Turbo Code Conf"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.490504"},{"key":"ref44","first-page":"3","article-title":"New high-spread high-distance interleavers for turbo-codes","author":"crozier","year":"2000","journal-title":"Proc 20th Biennial Symp Commun"},{"key":"ref26","author":"rudin","year":"1967","journal-title":"Fourier Analysis on Groups"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525138"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055617"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6121971\/06121990.pdf?arnumber=6121990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:19Z","timestamp":1633909639000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6121990\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2169540","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}