The DOI matches its Crossref record.
Generalized Kraft Inequality and Arithmetic Coding
Abstract
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers lias parameters such that ∑i2−li≤2−ε. This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within ε. The coding speed is comparable to that of conventional coding methods.
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
Cited by
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Self-citationThe LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
Weinberger, M. J., Seroussi, G., & Sapiro, G. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.855427 · Cited by 1,638
An Introduction to Arithmetic Coding
Langdon, G. G. (1984) · IBM Journal of Research and Development · doi:10.1147/rd.282.0135 · Cited by 527
Merhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
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
Metadata
- Authors
- Rissanen, J. J.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1976-05
- Volume
- 20
- Issue
- 3
- Pages
- 198-203
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2046419776
- Cited by
- 510
- References
- 0
- FWCI
- 2.74
- 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: Generalized Kraft Inequality and Arithmetic Coding. https://app.cochat.ai/papers/10.1147/rd.203.0198
- The paper
- Rissanen, J. J. (1976). Generalized Kraft Inequality and Arithmetic Coding. IBM Journal of Research and Development. https://doi.org/10.1147/rd.203.0198
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.
