{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:07:35Z","timestamp":1774991255854,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541387","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"690-694","source":"Crossref","is-referenced-by-count":12,"title":["Novel lower bounds on the entropy rate of binary hidden Markov processes"],"prefix":"10.1109","author":[{"given":"Or","family":"Ordentlich","sequence":"first","affiliation":[{"name":"MIT, United States"}]}],"member":"263","reference":[{"key":"ref10","article-title":"On the capacity of finite state channels and the analysis of convolutional accumulate-m codes","author":"pfister","year":"2003"},{"key":"ref11","first-page":"362","article-title":"On the entropy of a hidden Markov process","author":"jacquet","year":"2004","journal-title":"DCC"},{"key":"ref12","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 Info Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.007"},{"key":"ref14","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":"ref4","article-title":"Strong data-processing inequalities for channels and Bayesian networks","author":"polyanskiy","year":"2016"},{"key":"ref3","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2479641"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875399"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.005"},{"key":"ref2","article-title":"On the entropy of a noisy function","author":"samorodnitsky","year":"2015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055107"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704462"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541387.pdf?arnumber=7541387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:54:11Z","timestamp":1774986851000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541387\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541387","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}