{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:30:35Z","timestamp":1775017835557,"version":"3.50.1"},"reference-count":30,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1134\/s0032946020010020","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T10:02:44Z","timestamp":1587031364000},"page":"13-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields"],"prefix":"10.1134","volume":"56","author":[{"given":"R.","family":"Aragona","sequence":"first","affiliation":[]},{"given":"F.","family":"Marzi","sequence":"additional","affiliation":[]},{"given":"F.","family":"Mignosi","sequence":"additional","affiliation":[]},{"given":"M.","family":"Spezialetti","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2020,4,16]]},"reference":[{"issue":"2","key":"4367_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1214\/aop\/1176990840","volume":"18","author":"D Ornstein","year":"1990","unstructured":"Ornstein, D. and Shields, P.C., Universal Almost Sure Data Compression, Ann. Probab., 1990, vol. 18, no. 2, pp. 441\u2013452.","journal-title":"Ann. Probab."},{"key":"4367_CR2","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/013","volume-title":"The Ergodic Theory of Discrete Sample Paths","author":"PC Shields","year":"1996","unstructured":"Shields, P.C., The Ergodic Theory of Discrete Sample Paths, Providence, R.I.: Amer. Math. Soc., 1996."},{"issue":"3","key":"4367_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E., A Mathematical Theory of Communication, Bell Syst. Tech. J., 1948, vol. 27, no. 3, pp. 379\u2013423.","journal-title":"Bell Syst. Tech. J."},{"key":"4367_CR4","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M. and Thomas, J.A., Elements of Information Theory, Hoboken, NJ: Wiley, 2006, 2nd ed.","edition":"2nd ed"},{"issue":"2","key":"4367_CR5","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1214\/aoms\/1177729028","volume":"24","author":"B McMillan","year":"1953","unstructured":"McMillan, B., The Basic Theorems of Information Theory, Ann. Math. Statist., 1953, vol. 24, no. 2, pp. 196\u2013219.","journal-title":"Ann. Math. Statist."},{"issue":"3","key":"4367_CR6","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1214\/aoms\/1177706899","volume":"28","author":"L Breiman","year":"1957","unstructured":"Breiman, L., The Individual Ergodic Theorem of Information Theory, Ann. Math. Statist., 1957, vol. 28, no. 3, pp. 809\u2013811.","journal-title":"Ann. Math. Statist."},{"issue":"3","key":"4367_CR7","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1214\/aoms\/1177705812","volume":"31","author":"L Breiman","year":"1960","unstructured":"Breiman, L., Correction Notes: Correction to \u201cThe Individual Ergodic Theorem of Information Theory,\u201d Ann. Math. Statist., 1960, vol. 31, no. 3, pp. 809\u2013810.","journal-title":"Ann. Math. Statist."},{"issue":"2","key":"4367_CR8","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1214\/aoms\/1177705069","volume":"2","author":"KL Chung","year":"1961","unstructured":"Chung, K.L., A Note on the Ergodic Theorem of Information Theory, Ann. Math. Statist., 1961, vol. 2, no. 2, pp. 612\u2013614.","journal-title":"Ann. Math. Statist."},{"key":"4367_CR9","first-page":"141","volume-title":"Recent Developments in Information and Decision Processes (Proc. 3rd Sympos. on Information and Decision Processes, Purdue Univ., Lafayette, IN, USA, April 12\u201313, 1961)","author":"KL Chung","year":"1962","unstructured":"Chung, K.L., The Ergodic Theorem of Information Theory, Recent Developments in Information and Decision Processes (Proc. 3rd Sympos. on Information and Decision Processes, Purdue Univ., Lafayette, IN, USA, April 12\u201313, 1961), Machol, R.E. and Gray, P.E., Eds., New York: Macmillan, 1962, pp. 141\u2013148."},{"issue":"1","key":"4367_CR10","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/18.481795","volume":"42","author":"C Blundo","year":"1996","unstructured":"Blundo, C. and De Prisco, R., New Bounds on the Expected Length of One-to-One Codes, IEEE Trans. Inform. Theory, 1996, vol. 42, no. 1, pp. 246\u2013250.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4367_CR11","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.605604","volume":"43","author":"I Kontoyiannis","year":"1997","unstructured":"Kontoyiannis, I., Second-Order Noiseless Source Coding Theorems, IEEE Trans. Inform. Theory, 1997, vol. 43, no. 4, pp. 1339\u20131341.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4367_CR12","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TIT.2013.2291007","volume":"60","author":"I Kontoyiannis","year":"2014","unstructured":"Kontoyiannis, I. and Verd\u00fa, S., Optimal Lossless Data Compression: Non-asymptotics and Asymptotics, IEEE Trans. Inform. Theory, 2014, vol. 60, no. 2, pp. 777\u2013795.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"355","key":"4367_CR13","first-page":"3","volume":"8","author":"AYa Khinchin","year":"1953","unstructured":"Khinchin, A.Ya., The Entropy Concept in Probability Theory, Uspekhi Mat. Nauk, 1953, vol. 8, no. 3 (55), pp. 3\u201320.","journal-title":"Uspekhi Mat. Nauk"},{"key":"4367_CR14","volume-title":"Information Theory and Network Coding","author":"RW Yeung","year":"2008","unstructured":"Yeung, R.W., Information Theory and Network Coding, Boston: Springer, 2008."},{"key":"4367_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csiszar","year":"2011","unstructured":"Csiszar, I. and K\u00f6rner, J., Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge, UK: Cambridge Univ. Press, 2011, 2nd ed.","edition":"2nd ed"},{"key":"4367_CR16","volume-title":"Information Theory, Inference and Learning Algorithms","author":"DJC MacKay","year":"2003","unstructured":"MacKay, D.J.C., Information Theory, Inference and Learning Algorithms, New York: Cambridge Univ. Press, 2003."},{"key":"4367_CR17","volume-title":"PhD Thesis","author":"AR Barron","year":"1985","unstructured":"Barron, A.R., Logically Smooth Density Estimation, PhD Thesis, Stanford Univ., CA, USA, 1985."},{"issue":"2","key":"4367_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/18.75241","volume":"37","author":"JC Kieffer","year":"1991","unstructured":"Kieffer, J.C., Sample Converses in Source Coding Theory, IEEE Trans. Inform. Theory, 1991, vol. 37, no. 2, pp. 263\u2013268.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4367_CR19","volume-title":"PhD Thesis","author":"PH Algoet","year":"1985","unstructured":"Algoet, P.H., Log-Optimum Investment, PhD Thesis, Stanford Univ., CA, USA, 1985."},{"key":"4367_CR20","volume-title":"Mathematical Foundations of Information Theory","author":"AI Khinchin","year":"1957","unstructured":"Khinchin, A.I., Mathematical Foundations of Information Theory, New York: Dover, 1957."},{"issue":"1","key":"4367_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2140\/pjm.1974.51.203","volume":"51","author":"JC Kieffer","year":"1974","unstructured":"Kieffer, J.C., A Simple Proof of the Moy-Perez Generalization of the Shannon-McMillan Theorem, Pacific J. Math., 1974, vol. 51, no. 1, pp. 203\u2013206.","journal-title":"Pacific J. Math."},{"key":"4367_CR22","volume-title":"Information Theory and Reliable Communication","author":"RG Gallager","year":"1968","unstructured":"Gallager, R.G., Information Theory and Reliable Communication, New York: Wiley, 1968."},{"issue":"2","key":"4367_CR23","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1214\/aop\/1176991794","volume":"16","author":"PH Algoet","year":"1988","unstructured":"Algoet, P.H. and Cover, T.M., A Sandwich Proof of the Shannon-McMillan-Breiman Theorem, Ann. Probab., 1988, vol. 16, no. 2, pp. 899\u2013909.","journal-title":"Ann. Probab."},{"issue":"4","key":"4367_CR24","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1214\/aop\/1176992813","volume":"13","author":"AR Barron","year":"1985","unstructured":"Barron, A.R., The Strong Ergodic Theorem for Densities: Generalized Shannon-McMillan-Breiman Theorem, Ann. Probab., 1985, vol. 13, no. 4, pp. 1292\u20131303.","journal-title":"Ann. Probab."},{"issue":"1","key":"4367_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00222-003-0318-3","volume":"155","author":"I Bjelakovi\u0107","year":"2004","unstructured":"Bjelakovi\u0107, I., Kr\u00fcger, T., Siegmund-Schultze, R., and Szko\u0142a, A., The Shannon-McMillan Theorem for Ergodic Quantum Lattice Systems, Invent. Math., 2004, vol. 155, no. 1, pp. 203\u2013222.","journal-title":"Invent. Math."},{"issue":"5","key":"4367_CR26","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/TIT.1979.1056081","volume":"25","author":"G Longo","year":"1979","unstructured":"Longo, G. and Sgarro, A., The Source Coding Theorem Revisited: A Combinatorial Approach, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 5, pp. 544\u2013548.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4367_CR27","first-page":"515","volume-title":"Proc. 9th Annual Sympos. on Theoretical Aspects of Computer Science (STACS\u201992), Cachan, France, Feb. 13\u201315, 1992","author":"G Hansel","year":"1992","unstructured":"Hansel, G., Perrin, D., and Simon, I., Compression and Entropy, Proc. 9th Annual Sympos. on Theoretical Aspects of Computer Science (STACS\u201992), Cachan, France, Feb. 13\u201315, 1992, Finkel, A. and Jantzen, M., Eds., Lect. Notes Comp. Sci., vol. 577, Berlin: Springer, 1992, pp. 515\u2013528."},{"issue":"2","key":"4367_CR28","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P., Universal Codeword Sets and Representations of the Integers, IEEE Trans. Inform. Theory, 1975, vol. 21, no. 2, pp. 194\u2013203.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4367_CR29","volume-title":"PhD Thesis","author":"LG Kraft","year":"1949","unstructured":"Kraft, L.G., A Device for Quantizing, Grouping, and Coding Amplitude-Modulated Pulses, PhD Thesis, MIT, Cambridge, USA, 1949."},{"key":"4367_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-07407-4_13","volume-title":"Automata Theory and Formal Languages (Proc. 2nd GI Conf., Kaiserslautern, Germany, May 20\u201323, 1975)","author":"A de Luca","year":"1975","unstructured":"de Luca, A., On the Entropy of a Formal Language, Automata Theory and Formal Languages (Proc. 2nd GI Conf., Kaiserslautern, Germany, May 20\u201323, 1975), Brakhage, H., Ed., Lect. Notes Comp. Sci., vol. 33, Berlin: Springer, 1975, pp. 103\u2013109."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020010020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020010020","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020010020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:48:36Z","timestamp":1775011716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020010020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["4367"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020010020","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"12 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}