The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Codes Which Detect Deception
Abstract
We consider a new kind of coding problem, which has applications in a variety of situations. A message x is to be encoded using a key m to form an encrypted message y = Φ(x, m), which is then supplied to a user G. G knows m and so can calculate x. It is desired to choose Φ(.,.) so as to protect G against B, who knows x, y, and Φ(.,.) (but not m); B may substitute a false message y' for y. It is shown that if the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1. Several encoding functions Φ(.,.) are given, some of which achieve this bound.
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
A New Interpretation of Information Rate
Kelly, J. L. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03809.x · Cited by 1,586
Stiffler, J. J. (1971) · Cited by 1,438
Run-length encodings (Corresp.)
Golomb, S. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053907 · Cited by 988
Ryser, H. (1963) · Carus Mathematical Monographs · doi:10.5948/upo9781614440147 · Cited by 969
An Introduction to Probability Theory and its Applications.
David, F. N., & Feller, W. (1958) · Biometrika · doi:10.2307/2333079 · Cited by 465
SAKATA, S. (2008) · IEICE ESS Fundamentals Review · doi:10.1587/essfr.1.3_44 · Cited by 347
The two-armed-bandit problem with time-invariant finite memory
Cover, T. M., & Hellman, M. E. (1970) · IEEE Transactions on Information Theory · doi:10.1109/tit.1970.1054427 · Cited by 88
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
LFSR-based Hashing and Authentication
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_15 · Cited by 491
Privacy and authentication: An introduction to cryptography
Diffie, W., & Hellman, M. E. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11256 · Cited by 470
Metadata
- Authors
- Gilbert, E. N., MacWilliams, F. J., & Sloane, N. J. A.
- Venue
- Bell System Technical Journal
- Published
- 1974-03
- Volume
- 53
- Issue
- 3
- Pages
- 405-424
- ISSN
- 0005-8580 (ISSN-L)
- OpenAlex
- W2028732372
- Cited by
- 381
- References
- 7
- FWCI
- 0.58
- 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: Codes Which Detect Deception. https://app.cochat.ai/papers/10.1002/j.1538-7305.1974.tb02751.x
- The paper
- Gilbert, E. N., MacWilliams, F. J., & Sloane, N. J. A. (1974). Codes Which Detect Deception. Bell System Technical Journal. https://doi.org/10.1002/j.1538-7305.1974.tb02751.x
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.