The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Off-line dictionary-based compression
Abstract
Dictionary-based modeling is a mechanism used in many practical compression schemes. In most implementations of dictionary-based compression the encoder operates on-line, incrementally inferring its dictionary of available phrases from previous parts of the message. An alternative approach is to use the full message to infer a complete dictionary in advance, and include an explicit representation of the dictionary as part of the compressed message. In this investigation, we develop a compression scheme that is a combination of a simple but powerful phrase derivation method and a compact dictionary encoding. The scheme is highly efficient, particularly in decompression, and has characteristics that make it a favorable choice when compressed data is to be searched directly. We describe data structures and algorithms that allow our mechanism to operate in linear time and space.
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
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
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
Implementing the PPM data compression scheme
Moffat, A. (1990) · IEEE Transactions on Communications · doi:10.1109/26.61469 · Cited by 420
Self-citationA note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
Langdon, G. G. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056645 · Cited by 85
AN ALGORITHM FOR THE SEGMENTATION OF AN ARTIFICIAL LANGUAGE ANALOGUE
Wolff, J. G. (1975) · British Journal of Psychology · doi:10.1111/j.2044-8295.1975.tb01442.x · Cited by 57
The relationship between greedy parsing and symbolwise text compression
Bell, T., & Witten, I. H. (1994) · Journal of the ACM · doi:10.1145/179812.179892 · Cited by 17
Metadata
- Authors
- Larsson, N. J., & Moffat, A.
- Venue
- Proceedings of the IEEE
- Published
- 2000-11
- Volume
- 88
- Issue
- 11
- Pages
- 1722-1732
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2602771387
- Cited by
- 259
- References
- 7
- FWCI
- 3.33
- 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
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.