Journal article · 1990 · Open access
Universal Almost Sure Data Compression
The Annals of Probability, 18(2), 441–452 · Published 1 April 1990 · DOI 10.1214/aop/1176990840
In brief
“Universal Almost Sure Data Compression” is a 1990 journal article by Donald S. Ornstein and Paul C. Shields, published in The Annals of Probability. OpenAlex counts 68 citations as of 16 November 2026. It is open access: the full text is free to read at The Annals of Probability.
- Citations
- 68
- Most cited in
- 2023 (4)
- Field-weighted impact
- 5.44
- References
- 9
- Authors
- 2
Abstract
An $n$-code is a mapping $c_n$ from the set $A^n$ of sequences of length $n$ drawn from a finite set $A$ into the set of finite length binary sequences $B^\ast$. A decoder with distortion $D$ is a map from $B^\ast$ back into $A^n$ that sends $c_n(a^n_1)$ into a sequence that agrees with $a^n_1$ in all but at most $Dn$ places. We describe a sequence of codes and associated decoders of distortion $D$ such that, for almost every sequence from an ergodic process, the number of bits per $A$-symbol converges almost surely to $R(D)$, the optimal compression attainable for the process. The codes are universal in that the statistics of the process need not be known in advance. Expected value results of this type were first obtained by Davisson and, independently, Fittinghof; almost sure results for the invertible case $(D = 0)$ are implicitly contained in the Ziv-Lempel algorithm. Our results also apply, virtually without change in proof, to random fields.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ornstein, D. S., & Shields, P. C. (1990). Universal Almost Sure Data Compression. The Annals of Probability, 18(2), 441–452. https://doi.org/10.1214/aop/1176990840
MLA 9
Ornstein, Donald S., and Paul C. Shields. “Universal Almost Sure Data Compression.” The Annals of Probability, vol. 18, no. 2, 1990, pp. 441–452. https://doi.org/10.1214/aop/1176990840.
Chicago
Ornstein, Donald S. and Paul C. Shields. 1990. “Universal Almost Sure Data Compression.” The Annals of Probability 18 (2): 441–452. https://doi.org/10.1214/aop/1176990840.
Harvard
Ornstein, D. S. and Shields, P. C. (1990) ‘Universal Almost Sure Data Compression’, The Annals of Probability, 18(2), pp. 441–452. doi:10.1214/aop/1176990840.
IEEE
D. S. Ornstein and P. C. Shields, “Universal Almost Sure Data Compression,” The Annals of Probability, vol. 18, no. 2, pp. 441–452, 1990, doi: 10.1214/aop/1176990840.
BibTeX
@article{ornstein1990universal,
title = {{Universal Almost Sure Data Compression}},
author = {Ornstein, Donald S. and Shields, Paul C.},
journal = {The Annals of Probability},
year = {1990},
volume = {18},
number = {2},
pages = {441--452},
doi = {10.1214/aop/1176990840},
url = {https://doi.org/10.1214/aop/1176990840}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2015 | 1 | |
| 2017 | 1 | |
| 2019 | 1 | |
| 2020 | 1 | |
| 2021 | 1 | |
| 2022 | 2 | |
| 2023 | 4 | |
| 2024 | 2 | |
| 2025 | 3 | |
| 2026 | 2 |
Its field-weighted citation impact is 5.44: it has been cited 5.44 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- universal compression
- ergodic processes
- universal coding
- rate-distortion function
- random fields
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?
Ornstein, D. S., & Shields, P. C. (1990). Universal Almost Sure Data Compression. The Annals of Probability, 18(2), 441–452. https://doi.org/10.1214/aop/1176990840
How many times has this paper been cited?
68 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 The Annals of Probability.
Who wrote this paper?
Donald S. Ornstein, Paul C. Shields.
What is the DOI of this paper?
10.1214/aop/1176990840. The permanent link is https://doi.org/10.1214/aop/1176990840.
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.