The DOI matches its Crossref record.
Enumerative source encoding
Abstract
LetSbe a given subset of binary n-sequences. We provide an explicit scheme for calculating the index of any sequence inSaccording to its position in the lexicographic ordering ofS. A simple inverse algorithm is also given. Particularly nice formulas arise whenSis the set of alln-sequences of weightkand also whenSis the set of all sequences having a given empirical Markov property. Schalkwijk and Lynch have investigated the former case. The envisioned use of this indexing scheme is to transmit or store the index rather than the sequence, thus resulting in a data compression of(\log\midS\mid)/n.
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
An Introduction to Arithmetic Coding
Langdon, G. G. (1984) · IBM Journal of Research and Development · doi:10.1147/rd.282.0135 · Cited by 527
Bellare, M., Ristenpart, T., Rogaway, P., & Stegers, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-05445-7_19 · Cited by 274
Fast quantum computation at arbitrarily low energy
Jordan, S. P. (2017) · Physical Review A · doi:10.1103/physreva.95.032305 · Cited by 40
Metadata
- Authors
- Cover, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1973-01
- Volume
- 19
- Issue
- 1
- Pages
- 73-77
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2034323860
- Cited by
- 504
- References
- 0
- FWCI
- 8.03
- 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: Enumerative source encoding. https://app.cochat.ai/papers/10.1109/tit.1973.1054929
- The paper
- Cover, T. (1973). Enumerative source encoding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1973.1054929
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.
