{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T06:10:13Z","timestamp":1698300613442},"reference-count":13,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":5674,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1993,3]]},"abstract":"Abstract<\/jats:title>We show that there is a universal noiseless source code for the class of all coun\u2010tably infinite memoryless sources for which a fixed given uniquely decodable code has finite expected codeword length. This source code is derived from a class of distribution estimation procedures which are consistent in expected information divergence.<\/jats:p>","DOI":"10.1002\/ett.4460040207","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T12:08:17Z","timestamp":1221221297000},"page":"125-132","source":"Crossref","is-referenced-by-count":17,"title":["On Universal Noiseless Source Coding for Infinite Source Alphabets"],"prefix":"10.1002","volume":"4","author":[{"given":"L\u00e1szl\u00f3","family":"Gy\u00f6rfi","sequence":"first","affiliation":[]},{"given":"Istv\u00e1n","family":"P\u00e1li","sequence":"additional","affiliation":[]},{"given":"Edward C.","family":"Van Der Meulen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.149496"},{"key":"e_1_2_1_3_2","volume-title":"Real analysis and probability","author":"Ash R. B.","year":"1972"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"e_1_2_1_5_2","volume-title":"Rate distortion theory","author":"Berger T.","year":"1971"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90365-8"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"e_1_2_1_8_2","unstructured":"L.GyOrfi I.Pali E. C.van der Meulen:There is no universal source code for infinite alphabet. (In preparation)."},{"key":"e_1_2_1_9_2","unstructured":"I.Csisz\u00e1r Generalized entropy and quantization problems. In:Transactions of the Sixth Prague Conference on Information Theory Statistical Decision Functions. Random Processes(Academia Prague) p.159\u2013174 1973."},{"key":"e_1_2_1_10_2","volume-title":"Information theory and reliable communication","author":"Gallager R. G.","year":"1968"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_2_1_12_2","volume-title":"Information theory: Coding theorems for discrete memoryless systems","author":"Csiszar I.","year":"1981"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057034"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.2612"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460040207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460040207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T17:02:54Z","timestamp":1698253374000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460040207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["10.1002\/ett.4460040207"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460040207","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}