{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:08Z","timestamp":1725560168286},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_57","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:10:53Z","timestamp":1279825853000},"page":"736-737","source":"Crossref","is-referenced-by-count":1,"title":["Universal Coding of Zipf Distributions"],"prefix":"10.1007","author":[{"given":"Yoav","family":"Freund","sequence":"first","affiliation":[]},{"given":"Alon","family":"Orlitsky","sequence":"additional","affiliation":[]},{"given":"Prasad","family":"Santhanam","sequence":"additional","affiliation":[]},{"given":"Junan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","volume":"27","author":"R.E. Krichevsky","year":"1981","unstructured":"Krichevsky, R.E., Trofimov, V.K.: The preformance of universal coding. IEEE Transactions on Information Theory\u00a027, 199\u2013207 (1981)","journal-title":"IEEE Transactions on Information Theory"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Zipf, G.: Selective studies and the principle of relative frequency in language. Technical report, Harvard university press (1932)","DOI":"10.4159\/harvard.9780674434929"},{"key":"57_CR3","unstructured":"Li, W.: North Shore LIJ Research Institure, \n                      \n                        http:\/\/linkage.rockefeller.edu\/wli\/zipf\/"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Jevtic, N., Orlitsky, A., Santhanam, N.P.: Universal compression of unknown alphabets. In: IEEE Symposium on Information Theory (2002)","DOI":"10.1109\/ISIT.2002.1023592"},{"key":"57_CR5","unstructured":"Aberg, J., Shtarkov, Y.M., Smeets, B.J.M.: Multialphabet coding with separate alphabet description. In: Proceedings of compression and complexity of sequences (1997)"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Orlitsky, A., Santhanam, N.P., Zhang, J.: Bounds on compression of unknown alphabets. In: IEEE Symposium on Information Theory (2003)","DOI":"10.1109\/ISIT.2003.1228125"},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0890-5401(02)00033-0","volume":"182","author":"Y. Freund","year":"2003","unstructured":"Freund, Y.: Predicting a binary sequence almost as well as the optimal biased coin. Information and Computation\u00a0182, 73\u201394 (2003)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T03:47:00Z","timestamp":1552794420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}