The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Arithmetic coding revisited
Open accessAbstract
Over the last decade, arithmetic coding has emerged as an important compression tool. It is now the method of choice for adaptive coding on myltisymbol alphabets because of its speed, low storage requirements, and effectiveness of compression. This article describes a new implementation of arithmetic coding that incorporates several improvements over a widely used earlier version by Witten, Neal, and Cleary, which has become a de facto standard. These improvements include fewer multiplicative operations, greatly extended range of alphabet sizes and symbol probabilities, and the use of low-precision arithmetic, permitting implementation by fast shift/add operations. We also describe a modular structure that separates the coding, modeling, and probability estimation components of a compression system. To motivate the improved coder, we consider the needs of a word-based text compression program. We report a range of experimental results using this and other models. Complete source code is available.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
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
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
Self-citationA Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
Self-citationRun-length encodings (Corresp.)
Golomb, S. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053907 · Cited by 988
Bell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
Self-citationRissanen, J., & Langdon, G. G. (1979) · IBM Journal of Research and Development · doi:10.1147/rd.232.0149 · Cited by 751
Witten, I. H., & Bell, T. C. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.87000 · Cited by 729
Self-citationManaging Gigabytes: Compressing and Indexing Documents and Images
Witten, I. H., Moffat, A., & Bell, T. C. (1995) · IEEE Transactions on Information Theory · doi:10.1109/tit.1995.476344 · Cited by 726
Self-citationManaging gigabytes (2nd ed.): compressing and indexing documents and images
Witten, I. H., Moffat, A., & Bell, T. (1999) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 705
Self-citationVariations on a theme by Huffman
Gallager, R. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055959 · Cited by 546
An Introduction to Arithmetic Coding
Langdon, G. G. (1984) · IBM Journal of Research and Development · doi:10.1147/rd.282.0135 · Cited by 527
A locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
Generalized Kraft Inequality and Arithmetic Coding
Rissanen, J. J. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.203.0198 · Cited by 510
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454
Implementing the PPM data compression scheme
Moffat, A. (1990) · IEEE Transactions on Communications · doi:10.1109/26.61469 · Cited by 420
Self-citationOptimizing Preventive Service of Software Products
Adams, E. N. (1984) · IBM Journal of Research and Development · doi:10.1147/rd.281.0002 · Cited by 373
Overview of the Second Text Retrieval Conference (TREC-2)
Harman, D. (1995) · Information Processing & Management · doi:10.1016/0306-4573(94)00047-7 · Cited by 306
Data Compression Using Dynamic Markov Modelling
Cormack, G. V., & Horspool, R. N. S. (1987) · The Computer Journal · doi:10.1093/comjnl/30.6.541 · Cited by 213
A new data structure for cumulative frequency tables
Fenwick, P. M. (1994) · Software: Practice and Experience · doi:10.1002/spe.4380240306 · Cited by 200
Moffat, A. (1989) · Software: Practice and Experience · doi:10.1002/spe.4380190207 · Cited by 172
Self-citationApplication of splay trees to data compression
Jones, D. W. (1988) · Communications of the ACM · doi:10.1145/63030.63036 · Cited by 102
Analysis of arithmetic coding for data compression
Howard, P. G., & Vitter, J. S. (1992) · Information Processing & Management · doi:10.1016/0306-4573(92)90066-9 · Cited by 101
Algorithms for adaptive Huffman codes
Cormack, G. V., & Horspool, R. N. (1984) · Information Processing Letters · doi:10.1016/0020-0190(84)90021-8 · Cited by 60
(1990)
Cited by
Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard
Marpe, D., Schwarz, H., & Wiegand, T. (2003) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2003.815173 · Cited by 1,219
Metadata
- Authors
- Moffat, A., Neal, R. M., & Witten, I. H.
- Venue
- ACM Transactions on Information Systems
- Published
- 1998-07
- Volume
- 16
- Issue
- 3
- Pages
- 256-294
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2072210981
- Cited by
- 471
- References
- 28
- FWCI
- 14.44
- Type
- journal article
- Language
- en
- Open access
- bronze
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.