{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:11:53Z","timestamp":1775016713337,"version":"3.50.1"},"reference-count":19,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"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":[[2014,10]]},"DOI":"10.1134\/s0032946014040085","type":"journal-article","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T08:18:10Z","timestamp":1420532290000},"page":"390-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Universal coding for memoryless sources with countably infinite alphabets"],"prefix":"10.1134","volume":"50","author":[{"given":"B. D.","family":"Kudryashov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Porov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2015,1,7]]},"reference":[{"key":"4215_CR1","volume-title":"Compression for Multimedia","author":"I Bocharova","year":"2010","unstructured":"Bocharova, I., Compression for Multimedia, Cambridge: Cambridge Univ. Press, 2010."},{"issue":"5","key":"4215_CR2","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J. and Lempel, A., Compression of Individual Sequences via Variable-Rate Coding, IEEE Trans. Inform. Theory, 1978, vol. 24, no. 5, pp. 530\u2013536.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4215_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M. and Thomas, J.A., Elements of Information Theory, New York: Wiley, 1991."},{"issue":"3","key":"4215_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"SW Golomb","year":"1966","unstructured":"Golomb, S.W., Run-Length Encodings, IEEE Trans. Inform. Theory, 1966, vol. 12, no. 3, pp. 399\u2013401.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4215_CR5","volume-title":"Tech. Rep. of Jet Propulsion Lab., California Inst. of Technology","author":"RF Rice","year":"1979","unstructured":"Rice, R.F., Some Practical Universal Noiseless Coding Techniques, Tech. Rep. of Jet Propulsion Lab., California Inst. of Technology, Pasadena, CA, Mar. 15, 1979, no. JPL-79-22."},{"issue":"2","key":"4215_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/TIT.1975.1055357","volume":"21","author":"RG Gallager","year":"1975","unstructured":"Gallager, R.G. and Van Voorhis, D.C., Optimal Source Codes for Geometrically Distributed Integer Alphabets, IEEE Trans. Inform. Theory, 1975, vol. 21, no. 2, pp. 228\u2013230.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4215_CR7","first-page":"173","volume":"20","author":"VI Levenshtein","year":"1968","unstructured":"Levenshtein, V.I., On the Redundancy and Delay of Uniquely Decodable Codes for Natural Numbers, Probl. Kibern., 1968, vol. 20, pp. 173\u2013179.","journal-title":"Probl. Kibern."},{"issue":"2","key":"4215_CR8","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"},{"issue":"1","key":"4215_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIT.1987.1057251","volume":"33","author":"P Elias","year":"1987","unstructured":"Elias, P., Interval and Recency Rank Source Coding: Two On-line Adaptive Variable-Length Schemes, IEEE Trans. Inform. Theory, 1987, vol. 33, no. 1, pp. 3\u201310.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4215_CR10","volume-title":"Universal\u2019noe kodirovanie. Teoriya i algoritmy","author":"YuM Shtarkov","year":"2013","unstructured":"Shtarkov, Yu.M., Universal\u2019noe kodirovanie. Teoriya i algoritmy (Universal Coding: Theory and Algorithms), Moscow: Fizmatlit, 2013."},{"issue":"1","key":"4215_CR11","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/TIT.2008.2008150","volume":"55","author":"S Boucheron","year":"2009","unstructured":"Boucheron, S., Garivier, A., and Gassiat, E., Coding on Countably Infinite Alphabets, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 1, pp. 358\u2013373.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4215_CR12","first-page":"3","volume":"2","author":"BM Fitingof","year":"1966","unstructured":"Fitingof, B.M., Optimal Coding in the Case of Unknown and Changing Message Statistics, Probl. Peredachi Inf., 1966, vol. 2, no. 2, pp. 3\u201311 [Probl. Inf. Trans. (Engl. Transl.), 1966, vol. 2, no. 2, pp. 1\u20137].","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"4215_CR13","first-page":"13","volume":"7","author":"VF Babkin","year":"1971","unstructured":"Babkin, V.F., A Universal Encoding Method with Nonexponential Work Expenditure for a Source of Independent Messages, Probl. Peredachi Inf., 1971, vol. 7, no. 4, pp. 13\u201321 [Probl. Inf. Trans. (Engl. Transl.), 1971, vol. 7, no. 4, pp. 288\u2013294].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"4215_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","volume":"27","author":"RE Krichevsky","year":"1981","unstructured":"Krichevsky, R.E. and Trofimov, V.K., The Performance of Universal Coding, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 2, pp. 199\u2013207.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4215_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/18.272495","volume":"40","author":"L Gyorfi","year":"1994","unstructured":"Gyorfi, L., Pali, I., and van der Meulen, E.C., There Is No Universal Source Code for an Infinite Source Alphabet, IEEE Trans. Inform. Theory, 1994, vol. 40, no. 1, pp. 267\u2013271.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4215_CR16","doi-asserted-by":"crossref","unstructured":"Acharya, J., Das, H., Jafarpour, A., Orlitsky, A., and Suresh, A.T., Tight Bounds for Universal Compression of Large Alphabets, in Proc. 2013 IEEE Int. Sympos. on Information Theory (ISIT\u20192013), Istanbul, Turkey, July 7\u201312, 2013, pp. 2875\u20132879.","DOI":"10.1109\/ISIT.2013.6620751"},{"issue":"3","key":"4215_CR17","first-page":"3","volume":"23","author":"YuM Shtarkov","year":"1987","unstructured":"Shtarkov, Yu.M., Universal Sequential Coding of Single Messages, Probl. Peredachi Inf., 1987, vol. 23, no. 3, pp. 3\u201317 [Probl. Inf. Trans. (Engl. Transl.), 1987, vol. 23, no. 3, pp. 175\u2013186].","journal-title":"Probl. Peredachi Inf."},{"key":"4215_CR18","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. Translated under the title Teoriya informatsii i nadezhnaya svyaz\u2019, Moscow: Sov. Radio, 1974."},{"issue":"1","key":"4215_CR19","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/76.350779","volume":"5","author":"K Sharifi","year":"1995","unstructured":"Sharifi, K. and Leon-Garcia, A., Estimation of Shape Parameter for Generalized Gaussian Distributions in Subband Decompositions of Video, IEEE Trans. Circ. Syst. Video Techn., 1995, vol. 5, no. 1, pp. 52\u201356.","journal-title":"IEEE Trans. Circ. Syst. Video Techn."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946014040085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946014040085","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946014040085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946014040085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:39:07Z","timestamp":1775011147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946014040085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["4215"],"URL":"https:\/\/doi.org\/10.1134\/s0032946014040085","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"6 May 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}