The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Entropy and data compression schemes
Abstract
Some new ways of defining the entropy of a process by observing a single typical output sequence as well as a new kind of Shannon-McMillan-Breiman theorem are presented. This provides a new and conceptually very simple ways of estimating the entropy of an ergodic stationary source as well as new insight into the workings of such well-known data compression schemes as the Lempel-Ziv algorithm.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
Coding theorems for individual sequences
Ziv, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055911 · Cited by 180
Cited by
Interpretation of the Lempel-Ziv Complexity Measure in the Context of Biomedical Signal Analysis
Aboy, M., Hornero, R., Abasolo, D., & Alvarez, D. (2006) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2006.883696 · Cited by 407
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators
Beirami, A., & Nejati, H. (2013) · IEEE Transactions on Circuits and Systems II: Express Briefs · doi:10.1109/tcsii.2013.2258274 · Cited by 36
Metadata
- Authors
- Ornstein, D. S., & Weiss, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1993
- Volume
- 39
- Issue
- 1
- Pages
- 78-83
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2152755776
- Cited by
- 281
- References
- 3
- FWCI
- 4.44
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Entropy and data compression schemes. https://app.cochat.ai/papers/10.1109/18.179344
- The paper
- Ornstein, D. S., & Weiss, B. (1993). Entropy and data compression schemes. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.179344
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.