The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Arithmetic Coding
Abstract
The earlier introduced arithmetic coding idea has been generalized to a very broad and flexible coding technique which includes virtually all known variable rate noiseless coding techniques as special cases. An outstanding feature of this technique is that alphabet extensions are not required. A complete decodability analysis is given. The relationship of arithmetic coding to other known nonblock codes is illuminated.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
Information Theory and Coding.
Good, I. J., & Abramson, N. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343598 · Cited by 1,068
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
Self-citationCover, T. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054929 · Cited by 504
Variable-Length Binary Encodings
Gilbert, E. N., & Moore, E. F. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb01583.x · Cited by 354
Source coding algorithms for fast data compression
Pasco, R. C. (1976) · Cited by 191
Cited by
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
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
Neural Networks and Deep Learning
Theodoridis, S. (2015) · Machine Learning · doi:10.1016/b978-0-12-801522-3.00018-5 · Cited by 900
Information Science and Statistics
Andersen, E. B. (1986) · COMPSTAT · doi:10.1007/978-3-642-46890-2_1 · Cited by 899
Witten, I. H., & Bell, T. C. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.87000 · Cited by 729
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · now publishers, Inc. eBooks · doi:10.1561/9781933019543 · Cited by 589
An Introduction to Arithmetic Coding
Langdon, G. G. (1984) · IBM Journal of Research and Development · doi:10.1147/rd.282.0135 · Cited by 527
Self-citationMoffat, A., Neal, R. M., & Witten, I. H. (1998) · ACM Transactions on Information Systems · doi:10.1145/290159.290162 · Cited by 471
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454
Self-citationGood codes based on very sparse matrices
MacKay, D. J. C., & Neal, R. M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60693-9_13 · Cited by 451
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000004 · Cited by 420
Statistical and Inductive Inference by Minimum Message Length
(2005) · Information Science and Statistics · doi:10.1007/0-387-27656-4 · Cited by 349
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
Bell, T., Witten, I. H., & Cleary, J. G. (1989) · ACM Computing Surveys · doi:10.1145/76894.76896 · Cited by 261
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
Metadata
- Authors
- Rissanen, J., & Langdon, G. G.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1979-03
- Volume
- 23
- Issue
- 2
- Pages
- 149-162
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2911940095
- Cited by
- 751
- References
- 6
- FWCI
- 2.94
- 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.