{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:11:46Z","timestamp":1755216706478,"version":"3.43.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437764","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"216-220","source":"Crossref","is-referenced-by-count":4,"title":["Minimax Redundancy for Markov Chains with Large State Space"],"prefix":"10.1109","author":[{"given":"Kedar","family":"Tatwawadi","sequence":"first","affiliation":[{"name":"Dept. of Electrical Engineering, Stanford University"}]},{"given":"Jiantao","family":"Jiao","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, Stanford University"}]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, Stanford University"}]}],"member":"263","reference":[{"journal-title":"Estimating the fundamental limits is easier than achieving the fundamental limits","year":"2017","author":"jiao","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056652"},{"journal-title":"Elements of Information Theory","year":"2012","author":"cover","key":"ref12"},{"journal-title":"Minimax redundancy for Markov chains with large state space","year":"2018","author":"tatwawadi","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834734"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195769"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830765"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1561\/0400000003","article-title":"Mathematical aspects of mixing times in markov chains","volume":"1","author":"montenegro","year":"2006","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"journal-title":"Entropy rate estimation for markov chains with large state space","year":"2018","author":"han","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.782149"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.532877"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.382017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.556120"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"journal-title":"One Billion Word Benchmark for Measuring Progress in Statistical Language Modelling","year":"2013","author":"chelba","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v20-4039"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437764.pdf?arnumber=8437764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T18:36:52Z","timestamp":1754332612000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437764\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437764","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}