{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:45:10Z","timestamp":1730274310382,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205598","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"981-985","source":"Crossref","is-referenced-by-count":2,"title":["On arbitrarily varying Markov source coding and hypothesis LAO testing by non-informed statistician"],"prefix":"10.1109","author":[{"given":"Evgueni","family":"Haroutunian","sequence":"first","affiliation":[]},{"given":"Naira","family":"Grigoryan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisza?r","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"11","first-page":"457","article-title":"on logarithmically asymptotically optimal hypothesis testing for arbitrary varying source with side information\", lecture notes in computer science, volume 4123, \"general theory of information transfer and combinatorics","author":"ahlswede","year":"2004","journal-title":"Springer"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000008"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.661541"},{"key":"2","first-page":"75","article-title":"coloring hypergraphs: a new approach to multi-user source coding","volume":"4","author":"ahlswede","year":"1979","journal-title":"I J Comb Inform Syst Sci"},{"key":"1","first-page":"142","article-title":"coding theorems for a discrete source with a fidelity crite rion","volume":"7","author":"shannon","year":"1959","journal-title":"IRE Nat Conv Rec"},{"key":"10","first-page":"153","article-title":"on asymptotically optimal tests for markov chains","volume":"2","author":"haroutunian","year":"1989","journal-title":"The First World Congress of Bernoulli Society section 2"},{"key":"7","first-page":"181","article-title":"on the error exponent for source coding and for testing simple statistical hypotheses","volume":"6","author":"csisza?r","year":"1971","journal-title":"Studia Scientiarum Mathem Hung"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700150"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.53762"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057036"},{"key":"9","first-page":"76","article-title":"on asymptotically optimal testing of hypotheses concerning markov chain","volume":"23","author":"haroutunian","year":"1988","journal-title":"Izvestiya Akademii Nauk Armenii Mathematika"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00532119"}],"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\/05205598.pdf?arnumber=5205598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T19:51:50Z","timestamp":1489780310000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205598\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205598","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}