{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:06:00Z","timestamp":1729659960399,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620598","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"2109-2113","source":"Crossref","is-referenced-by-count":4,"title":["A randomized approach to the capacity of finite-state channels"],"prefix":"10.1109","author":[{"given":"Guangyue","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-005-7576-y"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2696-8"},{"journal-title":"System Identification Theory for the User","year":"1999","author":"ljung","key":"18"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181822"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878230"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/18.2600"},{"key":"16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.tcs.2008.01.012","article-title":"On the entropy of a hidden Markov process","volume":"395","author":"jacquet","year":"2008","journal-title":"Theoretical Computer Science"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039094"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173730"},{"key":"11","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1109\/TIT.2007.899467","article-title":"Derivatives of entropy rate in special families of hidden Markov chains","volume":"53","author":"han","year":"2007","journal-title":"IEEE Trans Info Theory"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1214\/08-AAP570"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/18.45284"},{"key":"20","article-title":"Constrained systems and coding for recording channels","author":"marcus","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523663"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405285"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.006"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965976"},{"journal-title":"On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-m Codes","year":"2003","author":"pfister","key":"26"},{"journal-title":"Digital Communications","year":"2000","author":"proakis","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/26.54971"},{"key":"29","first-page":"283","article-title":"Entropy and channel capacity in the regenerative setup with applications to Markov channels","author":"sharma","year":"2001","journal-title":"IEEE ISIT"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-75894-2"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885481"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936639"},{"journal-title":"Almost Sure Convergence","year":"1974","author":"stout","key":"30"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054829"},{"journal-title":"Introduction to Strong Mixing Conditions Volumes 1 2 and 3","year":"2007","author":"bradley","key":"6"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.002"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081110"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01447859"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2226701"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.490551"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620598.pdf?arnumber=6620598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:45:39Z","timestamp":1498074339000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620598\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620598","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}