The DOI matches its Crossref record.
Transmission of Information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Soukoreff, R. W., & MacKenzie, I. S. (2004) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2004.09.001 · Cited by 1,064
The measure of order and disorder in the distribution of species in fragmented habitat
Atmar, W., & Patterson, B. D. (1993) · Oecologia · doi:10.1007/bf00317508 · Cited by 1,050
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
Speculations Concerning the First Ultraintelligent Machine
Good, I. J. (1966) · Advances in Computers · doi:10.1016/s0065-2458(08)60418-0 · Cited by 703
A simple derivation of the coding theorem and some applications
Gallager, R. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053730 · Cited by 687
Understanding Human Mobility from Twitter
Jurdak, R., Zhao, K., Liu, J., AbouJaoude, M., Cameron, M., & Newth, D. (2015) · PLOS ONE · doi:10.1371/journal.pone.0131469 · Cited by 556
Noun classification from predicate-argument structures
Hindle, D. (1990) · Proceedings of the 28th annual meeting on Association for Computational Linguistics - · doi:10.3115/981823.981857 · Cited by 545
Generalized information functions
Daróczy, Z. (1970) · Information and Control · doi:10.1016/s0019-9958(70)80040-7 · Cited by 495
A heuristic discussion of probabilistic decoding
Fano, R. (1963) · IEEE Transactions on Information Theory · doi:10.1109/tit.1963.1057827 · Cited by 494
Self-citationPreparation, measurement and information capacity of optical quantum states
Yamamoto, Y., & Haus, H. A. (1986) · Reviews of Modern Physics · doi:10.1103/revmodphys.58.1001 · Cited by 448
Theoretical limitations on the transmission of data from analog sources
Goblick, T. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053821 · Cited by 398
Lower bounds to error probability for coding on discrete memoryless channels. II
Shannon, C. E., Gallager, R. G., & Berlekamp, E. R. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91200-4 · Cited by 384
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
Entropy nets: from decision trees to neural networks
Sethi, I. K. (1990) · Proceedings of the IEEE · doi:10.1109/5.58346 · Cited by 285
Structural basis of multistationary quantum systems. II. Effective few-particle dynamics
Teich, W. G., Obermayer, K., & Mahler, G. (1988) · Physical Review B · doi:10.1103/physrevb.37.8111 · Cited by 64
Metadata
- Authors
- Feinstein, A., & Fano, R. M.
- Venue
- Journal of the American Statistical Association
- Publisher
- JSTOR
- Published
- 1962-06
- Volume
- 57
- Issue
- 298
- Pages
- 507
- ISSN
- 0162-1459 (ISSN-L)
- OpenAlex
- W2264297261
- Cited by
- 360
- References
- 0
- FWCI
- 34.40
- 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.