{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:39:17Z","timestamp":1725475157269},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462446"},{"type":"electronic","value":"9783540462453"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889342_32","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T05:27:10Z","timestamp":1165469230000},"page":"547-552","source":"Crossref","is-referenced-by-count":4,"title":["On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information"],"prefix":"10.1007","author":[{"given":"R.","family":"Ahlswede","sequence":"first","affiliation":[]},{"given":"Ella","family":"Aloyan","sequence":"additional","affiliation":[]},{"given":"E.","family":"Haroutunian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Ahlswede, R.: Coloring hypergraphs: a new approach to multi-user source coding, I and II. J. Combin. Inform. System Sciences\u00a04(1), 75\u2013115 (1979); 5(2), 220\u2013269 (1980)"},{"issue":"2","key":"32_CR2","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/18.661541","volume":"44","author":"F.-W. Fu","year":"1998","unstructured":"Fu, F.-W., Shen, S.-Y.: Hypothesis testing for arbitrarily varying sources with exponential-type constraint. IEEE Trans. Inform. Theory\u00a044(2), 892\u2013895 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"32_CR3","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1981","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic press, New York (1981)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1214\/aoms\/1177700150","volume":"36","author":"W. Hoeffding","year":"1965","unstructured":"Hoeffding, W.: Asymptotically optimal tests for multinomial distributions. Ann. Math. Stat.\u00a036, 369\u2013401 (1965)","journal-title":"Ann. Math. Stat."},{"key":"32_CR5","first-page":"181","volume":"6","author":"I. Csisz\u00e1r","year":"1971","unstructured":"Csisz\u00e1r, I., Longo, G.: On the error exponent for source coding and for testing simple statistical hypotheses. Studia Sc. Math. Hungarica\u00a06, 181\u2013191 (1971)","journal-title":"Studia Sc. Math. Hungarica"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1214\/aos\/1176343804","volume":"5","author":"G. Tusnady","year":"1977","unstructured":"Tusnady, G.: On asymptotically optimal tests. Ann. Statist.\u00a05(2), 385\u2013393 (1977)","journal-title":"Ann. Statist."},{"issue":"1","key":"32_CR7","first-page":"58","volume":"5","author":"G. Longo","year":"1980","unstructured":"Longo, G., Sgarro, A.: The error exponent for the testing of simple statistical hypotheses, a combinatorial approach. J. Combin. Inform. System Sciences\u00a05(1), 58\u201367 (1980)","journal-title":"J. Combin. Inform. System Sciences"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00532119","volume":"55","author":"L. Birg\u00e9","year":"1981","unstructured":"Birg\u00e9, L.: Vitesse maximales de d\u00e9croissance des erreurs et tests optimaux associ\u00e9s, Z. Wahrsch. verw. Gebiete\u00a055, 261\u2013273 (1981)","journal-title":"Wahrsch. verw. Gebiete"},{"issue":"5\u20136","key":"32_CR9","first-page":"413","volume":"19","author":"E.A. Haroutunian","year":"1990","unstructured":"Haroutunian, E.A.: Logarithmically asymptotically optimal testing of multiple statistical hypotheses. Probl. Control and Inform. Theory\u00a019(5\u20136), 413\u2013421 (1990)","journal-title":"Probl. Control and Inform. Theory"},{"key":"32_CR10","unstructured":"Ahlswede, R., Haroutunian, E.: On logarithmically asymptotically optimal testing of hypotheses and identification: research program, examples and partial results (preprint)"}],"container-title":["Lecture Notes in Computer Science","General Theory of Information Transfer and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889342_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:58Z","timestamp":1619508658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889342_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462446","9783540462453"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11889342_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}