{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:09:09Z","timestamp":1729670949433,"version":"3.28.0"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205692","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"586-590","source":"Crossref","is-referenced-by-count":0,"title":["Capacity-achieving codes for channels with memory with maximum-likelihood decoding"],"prefix":"10.1109","author":[{"given":"Jung Hyun","family":"Bae","sequence":"first","affiliation":[]},{"given":"Achilleas","family":"Anastasopoulos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928274"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842677"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892778"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889606"},{"key":"33","first-page":"269","article-title":"matched information rate codes for binary isi channels","author":"ma","year":"2002","journal-title":"Proc International Symposium on Information Theory"},{"journal-title":"Modern Coding Theory","year":"2007","author":"richardson","key":"15"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365300"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856934"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899536"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080209"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813563"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853320"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/18.45284"},{"key":"20","article-title":"capacity-achieving codes for noisy channels with bounded graphical complexity and maximum likelihood decoding","author":"hsu","year":"2006","journal-title":"IEEE Trans Information Theory"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887511"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405305"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887467"},{"year":"0","key":"45"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1109\/18.782147"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"46","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/18.490551"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878230"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936639"},{"key":"25","first-page":"283","article-title":"entropy and channel capacity in the regenerative setup with applications to markov channels","author":"sharma","year":"2001","journal-title":"Proc International Symposium on Information Theory"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965976"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965977"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.2307\/2319442"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"journal-title":"Information Theory and Reliable Communications","year":"1968","author":"gallager","key":"1"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2001.955166"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"6","first-page":"150","author":"luby","year":"1997","journal-title":"Practical loss-resilient codes"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915709"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842626"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-0165-3_9","article-title":"capacity-achieving sequences","volume":"123","author":"shokrollahi","year":"2000","journal-title":"The IMA Volumes in Mathematics and Its Applications"},{"key":"8","first-page":"65","article-title":"new sequences of linear time erasure codes approaching channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proc International Symposium on Information Theory and its Applications"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205692.pdf?arnumber=5205692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:36:40Z","timestamp":1558499800000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205692\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205692","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}