The DOI matches its Crossref record.
Two inequalities implied by unique decipherability
Abstract
Consider a list ofbwords, each word being a string of letters from a given fixed alphabet ofaletters. If every string of words drawn from this list, when written out in letters without additional space marks to separate the words, is uniquely decipherable, then \begin{equation} a^{-l_1} + a^{-l_2} + \cdots + a^{-l_b} \leq 1, \qquad \qquad (1) \end{equation} wherel_i, 1 \leq i \leq b, is the length of theith word in the list. This result extends a remark of J. L. Doob, who derived the same inequality for lists of a more restricted kind. A consequence of (1) and work of Shannon is that this more restricted kind of list suffices in the search for codes with specified amounts of redundancy.
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
The performance of universal encoding
Krichevsky, R., & Trofimov, V. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056331 · Cited by 535
A First Course in Information Theory
Yeung, R. W. (2002) · Information Technology: Transmission, Processing and Storage · doi:10.1007/978-1-4419-8608-5 · Cited by 533
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
A Tutorial on Fisher information
Ly, A., Marsman, M., Verhagen, J., Grasman, R. P. P. P., & Wagenmakers, E.-J. (2017) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2017.05.006 · Cited by 274
Metadata
- Authors
- McMillan, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1956-12
- Volume
- 2
- Issue
- 4
- Pages
- 115-116
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2169476932
- Cited by
- 203
- References
- 0
- FWCI
- 6.35
- 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: Two inequalities implied by unique decipherability. https://app.cochat.ai/papers/10.1109/tit.1956.1056818
- The paper
- McMillan, B. (1956). Two inequalities implied by unique decipherability. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1956.1056818
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.