{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:29:07Z","timestamp":1729614547011,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034131","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"3009-3013","source":"Crossref","is-referenced-by-count":3,"title":["Limit theorems for the sample entropy of hidden Markov chains"],"prefix":"10.1109","author":[{"given":"Guangyue","family":"Han","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.255039"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-005-7576-y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"ref10","first-page":"1","article-title":"On the Lyapunov limit of error in the theory of probability","volume":"28a","author":"esseen","year":"1942","journal-title":"Ark Mat Astr och Fys"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.025"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885481"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034131"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899467"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205785"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039094"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878230"},{"key":"ref18","first-page":"362","article-title":"On the Entropy of a Hidden Markov Process (extended abstract)","author":"jacquet","year":"2004","journal-title":"Data Compression Conference"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557352"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.936146"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1941-0003498-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"key":"ref6","first-page":"13","article-title":"The entropy of functions of finite-state Markov chains","author":"blackwell","year":"1957","journal-title":"Trans First Prague Conf Information Thoery Statistical Decision Functions Random Processes"},{"journal-title":"Almost Sure Convergence","year":"1974","author":"stout","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704462"},{"key":"ref8","volume":"1 2 and 3","author":"bradley","year":"2007","journal-title":"Introduction to Strong Mixing Conditions"},{"key":"ref7","first-page":"107","article-title":"Basic Properties of Strong Mixing Conditions","volume":"2","author":"bradley","year":"2005","journal-title":"A Survey and Some Open Questions Probability Surveys"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936639"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365047"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004975"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1109\/TIT.2009.2013030","article-title":"On the entropy rate of hidden Markov processes observed through arbitrary memoryless channels","volume":"55","author":"luo","year":"2009","journal-title":"IEEE Trans Inform Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860432"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523663"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405285"},{"journal-title":"On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-m Codes","year":"2003","author":"pfister","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965976"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034131.pdf?arnumber=6034131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:35:40Z","timestamp":1497944140000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034131","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}