{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:46Z","timestamp":1725663706993},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552109"},{"type":"electronic","value":"9783540467755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55210-3_209","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:54:32Z","timestamp":1330232072000},"page":"513-528","source":"Crossref","is-referenced-by-count":12,"title":["Compression and entropy"],"prefix":"10.1007","author":[{"given":"Georges","family":"Hansel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imre","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1090\/S0002-9947-1965-0175106-9","volume":"114","author":"R. Adler","year":"1965","unstructured":"R. Adler, A. Konheim, and M. McAndrew, Topological entropy. Trans. Amer. Math. Soc, 114:309\u2013319, 1965.","journal-title":"Trans. Amer. Math. Soc"},{"key":"41_CR2","volume-title":"Text Compression","author":"T. C. Bell","year":"1990","unstructured":"T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice Hall, Englewood Cliffs, N.J., 1990."},{"key":"41_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N. Chomsky","year":"1958","unstructured":"N. Chomsky and G. A. Miller. Finite state languages. Information and Control 1:91\u2013112, 1958.","journal-title":"Information and Control"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science, 33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-07407-4_13","volume-title":"Automata Theory and Formal Languages","author":"A. Luca de","year":"1975","unstructured":"A. de Luca. On the entropy of a formal language. In H. Brakhage, editor, Automata Theory and Formal Languages, pages 103\u2013109, Springer-Verlag, Berlin, 1975. Lecture Notes in Computer Science, 33."},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0220034","volume":"20","author":"A. V. Goldberg","year":"1991","unstructured":"A. V. Goldberg and M. Sipser. Compression and ranking. SIAM J. Comput., 20:524\u2013536, 1991.","journal-title":"SIAM J. Comput."},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science, 377","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-51465-1_4","volume-title":"Electronic Dictionaries and Automata in Computational Linguistics","author":"G. Hansel","year":"1989","unstructured":"G. Hansel. Estimation of the entropy by the Lempel-Ziv method. In M. Gross and D. Perrin, editors, Electronic Dictionaries and Automata in Computational Linguistics, pages 51\u201365, Springer-Verlag, Berlin, 1989. Lecture Notes in Computer Science, 377."},{"key":"41_CR7","volume-title":"Mathematical Foundations of Information Theory","author":"A. I. Khinchin","year":"1957","unstructured":"A. I. Khinchin. Mathematical Foundations of Information Theory. Dover, New York, 1957."},{"key":"41_CR8","volume-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"D. E. Knuth","year":"1968","unstructured":"D. E. Knuth. The Art of Computer Programming, Vol. 1, Fundamental Algorithms. Addison-Wesley Pu. Co., Reading, MA, 1968."},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W. Kuich","year":"1970","unstructured":"W. Kuich. On the entropy of context-free languages. Information and Control, 16:173\u2013200, 1970.","journal-title":"Information and Control"},{"key":"41_CR10","volume-title":"Volume 17 of Encyclopedia of Mathematics and its Applications","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire. Combinatorics on Words. Volume 17 of Encyclopedia of Mathematics and its Applications, Addison-Wesley Pu. Co., Reading, MA, 1983."},{"key":"41_CR11","volume-title":"Volume 12 of Encyclopedia of Mathematics and its Applications","author":"N. F. G. Martin","year":"1981","unstructured":"N. F. G. Martin and J. W. England. Mathematical Theory of Entropy. Volume 12 of Encyclopedia of Mathematics and its Applications, Addison-Wesley Pu. Co., Reading, MA, 1981."},{"key":"41_CR12","unstructured":"S. E. Newhouse. Entropy in smooth dynamical systems. 1990. To appear in Proceedings of the 1990 World Congress of Mathematicians."},{"key":"41_CR13","unstructured":"D. Ornstein and B. Weiss. Entropy and data compression schemes. 1990. manuscript."},{"key":"41_CR14","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1214\/aop\/1176990840","volume":"18","author":"D. S. Ornstein","year":"1990","unstructured":"D. S. Ornstein and P. C. Shields. Universal almost sure data compression. The Annals of Probability, 18:441\u2013452, 1990.","journal-title":"The Annals of Probability"},{"key":"41_CR15","volume-title":"A Diary on Information Theory","author":"A. R\u00e9nyi","year":"1984","unstructured":"A. R\u00e9nyi. A Diary on Information Theory. John Wiley & Sons, New York, NY, 1984."},{"key":"41_CR16","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. E. Shannon","year":"1948","unstructured":"C. E. Shannon. A mathematical theory of communication. Bell System Technical J., 27:398\u2013403, 1948.","journal-title":"Bell System Technical J."},{"key":"41_CR17","volume-title":"Data Compression\u2014Methods and Theory","author":"J. A. Storer","year":"1988","unstructured":"J. A. Storer. Data Compression\u2014Methods and Theory. Computer Science Press, Rockville,MD, 1988."}],"container-title":["Lecture Notes in Computer Science","STACS 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55210-3_209.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:28:26Z","timestamp":1619558906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55210-3_209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552109","9783540467755"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-55210-3_209","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}