Journal article · 2003 · Open access
Problems of Robustness for Universal Coding Schemes
Problems of Information Transmission, 39(1), 32–46 · Published 1 January 2003 · DOI 10.1023/a:1023626414365
In brief
“Problems of Robustness for Universal Coding Schemes” is a 2003 journal article by Vladimir Vyacheslavovich V'yugin, published in Problems of Information Transmission. OpenAlex counts 3 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 3
- Most cited in
- 2015 (1)
- References
- 22
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
V'yugin, V. V. (2003). Problems of Robustness for Universal Coding Schemes. Problems of Information Transmission, 39(1), 32–46. https://doi.org/10.1023/a:1023626414365
MLA 9
V'yugin, Vladimir Vyacheslavovich. “Problems of Robustness for Universal Coding Schemes.” Problems of Information Transmission, vol. 39, no. 1, 2003, pp. 32–46. https://doi.org/10.1023/a:1023626414365.
Chicago
V'yugin, Vladimir Vyacheslavovich. 2003. “Problems of Robustness for Universal Coding Schemes.” Problems of Information Transmission 39 (1): 32–46. https://doi.org/10.1023/a:1023626414365.
Harvard
V'yugin, V. V. (2003) ‘Problems of Robustness for Universal Coding Schemes’, Problems of Information Transmission, 39(1), pp. 32–46. doi:10.1023/a:1023626414365.
IEEE
V. V. V'yugin, “Problems of Robustness for Universal Coding Schemes,” Problems of Information Transmission, vol. 39, no. 1, pp. 32–46, 2003, doi: 10.1023/a:1023626414365.
BibTeX
@article{vyugin2003problems,
title = {{Problems of Robustness for Universal Coding Schemes}},
author = {V'yugin, Vladimir Vyacheslavovich},
journal = {Problems of Information Transmission},
year = {2003},
volume = {39},
number = {1},
pages = {32--46},
doi = {10.1023/a:1023626414365},
url = {https://doi.org/10.1023/a:1023626414365}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- universal coding
- Lempel-Ziv compression
- robustness
- stationary ergodic sources
- ergodic Markov chains
- asymptotic optimality
- data compression
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
V'yugin, V. V. (2003). Problems of Robustness for Universal Coding Schemes. Problems of Information Transmission, 39(1), 32–46. https://doi.org/10.1023/a:1023626414365
How many times has this paper been cited?
3 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at arXiv (Cornell University).
Who wrote this paper?
Vladimir Vyacheslavovich V'yugin.
What is the DOI of this paper?
10.1023/a:1023626414365. The permanent link is https://doi.org/10.1023/a:1023626414365.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.