The DOI matches its Crossref record.
Error-Correcting Codes.
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
Self-citationA recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
Solving Multiclass Learning Problems via Error-Correcting Output Codes
Dietterich, T. G., & Bakiri, G. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.105 · Cited by 2,739
Kung (1982) · Computer · doi:10.1109/mc.1982.1653825 · Cited by 2,272
Juels, A., & Wattenberg, M. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319714 · Cited by 1,591
Estimates of error rates for codes on burst-noise channels
Elliott, E. O. (1963) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1963.tb00955.x · Cited by 1,321
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
Algorithm-Based Fault Tolerance for Matrix Operations
Huang, K.-H., & Abraham, J. A. (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676475 · Cited by 1,283
FPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
RAID: high-performance, reliable secondary storage
Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., & Patterson, D. A. (1994) · ACM Computing Surveys · doi:10.1145/176979.176981 · Cited by 1,198
Class of algorithms for decoding block codes with channel measurement information
Chase, D. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054746 · Cited by 1,105
Biometric cryptosystems: issues and challenges
Uludag, U., Pankanti, S., Prabhakar, S., & Jain, A. K. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2004.827372 · Cited by 921
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_9 · Cited by 751
Gaines, B. R. (1969) · Advances in Information Systems Science · doi:10.1007/978-1-4899-5841-9_2 · Cited by 745
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Generalized minimum distance decoding
Forney, G. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053873 · Cited by 565
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Plank, J. S. (1997) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199709)27:9<995::aid-spe111>3.0.co;2-6 · Cited by 525
Golomb, S. W., & Baumert, L. D. (1965) · Journal of the ACM · doi:10.1145/321296.321300 · Cited by 498
The fast Fourier transform in a finite field
Pollard, J. M. (1971) · Mathematics of Computation · doi:10.1090/s0025-5718-1971-0301966-0 · Cited by 467
The use of information sets in decoding cyclic codes
Prange, E. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057777 · Cited by 463
Good codes based on very sparse matrices
MacKay, D. J. C., & Neal, R. M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60693-9_13 · Cited by 451
Turbo Coding, Turbo Equalisation and Space‐Time Coding: For Transmission over Fading Channels
Hanzo, L., Liew, T. H., & Yeap, B. L. (2002) · Wiley eBooks · doi:10.1002/047085474x · Cited by 449
Proofs of retrievability: theory and implementation
Bowers, K. D., Juels, A., & Oprea, A. (2009) · Proceedings of the 2009 ACM workshop on Cloud computing security · doi:10.1145/1655008.1655015 · Cited by 447
Random numbers generated by linear recurrence modulo two
Tausworthe, R. C. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0184406-1 · Cited by 441
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
Self-citationNuclear Magnetic Double Resonance with an Incoherent Radio-Frequency Field
Ernst, R. R. (1966) · The Journal of Chemical Physics · doi:10.1063/1.1727409 · Cited by 370
Architecture Design for Soft Errors
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-369529-1.x5001-0 · Cited by 365
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Fast evaluation of logarithms in fields of characteristic two
Coppersmith, D. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056941 · Cited by 297
GRASSL, M., BETH, T., & RÖTTELER, M. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000079 · Cited by 283
Ensembles of Learning Machines
Valentini, G., & Masulli, F. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45808-5_1 · Cited by 276
Feedback shift registers, 2-adic span, and combiners with memory
Klapper, A., & Goresky, M. (1997) · Journal of Cryptology · doi:10.1007/s001459900024 · Cited by 264
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Vasic, B., & Milenkovic, O. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828066 · Cited by 263
Optimal algorithms for Byzantine agreement
Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62225 · Cited by 255
Finding low autocorrelation binary sequences with memetic algorithms
Gallardo, J. E., Cotta, C., & Fernández, A. J. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.03.005 · Cited by 59
Geometric robustness theory and biological networks
AY, N., & KRAKAUER, D. (2006) · Theory in Biosciences · doi:10.1016/j.thbio.2006.06.002 · Cited by 45
Metadata
- Authors
- Gallager, R. G., & Peterson, W. W.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1962-01
- Volume
- 16
- Issue
- 77
- Pages
- 123
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2064759901
- Cited by
- 2,041
- References
- 0
- FWCI
- 62.92
- 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.