The DOI matches its Crossref record.
Introduction to Coding Theory
Abstract
Error-correcting codes constitute one of the key ingredients in achieving the high degree of reliability required in modern data transmission and storage systems. This 2006 book introduces the reader to the theoretical foundations of error-correcting codes, with an emphasis on Reed-Solomon codes and their derivative codes. After reviewing linear codes and finite fields, the author describes Reed-Solomon codes and various decoding algorithms. Cyclic codes are presented, as are MDS codes, graph codes, and codes in the Lee metric. Concatenated, trellis, and convolutional codes are also discussed in detail. Homework exercises introduce additional concepts such as Reed-Muller codes, and burst error correction. The end-of-chapter notes often deal with algorithmic issues, such as the time complexity of computational problems. While mathematical rigor is maintained, the text is designed to be accessible to a broad readership, including students of computer science, electrical engineering, and mathematics, from senior-undergraduate to graduate level.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For example, the Reed–Solomon code can correct up to e erasures and s substitutions with 2s + e additional symbols.”
From Emerging Approaches to DNA Data Storage: Challenges and Prospects (2022) · cites this paper as [90]
Citations
Cited by
Sorted by citations
Items 301–400 of 923
Applications of Derandomization Theory in CodingPreprint
Cheraghchi, M. (2010) · arXiv (Cornell University) · doi:10.5075/epfl-thesis-4767 · Cited by 11
Variant Codes Based on a Special Polynomial Ring and Their Fast Computations
Yu, L., Han, Y. S., Yuan, J., et al. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3383849 · Cited by 10
Receive spatial coding for distributed diversity
Love, D. J., Choi, J. J., & Bidigare, P. (2013) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2013.6810350 · Cited by 10
Simultaneous Partial Inverses and Decoding Interleaved Reed–Solomon Codes
Yu, J.-H., & Loeliger, H. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2868701 · Cited by 10
Single-Photon Structured Light
Sundar, V., Ma, S., Sankaranarayanan, A. C., & Gupta, M. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.01734 · Cited by 11
An Improvement of the Gilbert–Varshamov Bound Over Nonprime Fields
Bassa, A., Beelen, P., Garcia, A., et al. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2316531 · Cited by 10
Switching reconstruction and diophantine equations
Krasikov, I., & Roditty, Y. (1992) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(92)90050-8 · Cited by 10
Near MDS poset codes and distributions
Barg, A., & Purk, P. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513736 · Cited by 10
Some fundamental coding theoretic limits of unequal error protection
Borade, S., & Sanghavi, S. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205858 · Cited by 10
An introduction to coding theory.
Jones, C. (2001) · Cited by 10
Dense Error-Correcting Codes in the Lee MetricPreprint
Etzion, T., Vardy, A., & Yaakobi, E. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.0366 · Cited by 10
A Coded Shared Atomic Memory Algorithm for Message Passing ArchitecturesPreprint
Cadambe, V. R., Lynch, N. A., Médard, M., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.4167 · Cited by 10
Information- and Coding-Theoretic Analysis of the RLWE/MLWE Channel
Maringer, G., Puchinger, S., & Wachter-Zeh, A. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3226907 · Cited by 9
Generalized bilinear forms graphs and MRD codes over a residue class ring
Huang, L. (2018) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2018.02.003 · Cited by 9
Application-Aware Resource Allocation based on Channel Information for Cellular Networks
Shajaiah, H., Ghorbanzadeh, M., Abdelhadi, A., et al. (2019) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2019.8885591 · Cited by 9
On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4
Davydov, A. A., Marcugini, S., & Pambianco, F. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3089129 · Cited by 9
Correcting Grain-Errors in Magnetic Media
Gabrys, R., Yaakobi, E., & Dolecek, L. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2409860 · Cited by 9
Decoding algorithm and architecture for BCH codes under the Lee Metric
Wu, Y., & Hadjicostis, C. N. (2008) · IEEE Transactions on Communications · doi:10.1109/tcomm.2008.041227 · Cited by 9
Idempotents, Mattson-Solomon polynomials and binary LDPC codes
Horan, R., Tjhai, C. J., Tomlinson, M., et al. (2006) · IEE Proceedings - Communications · doi:10.1049/ip-com:20050415 · Cited by 9
On trace codes and Galois invariance over finite commutative chain rings
Martı́nez-Moro, E., Nicolás, A. P., & Rúa, I. F. (2013) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2013.03.004 · Cited by 9
Reversible Low-Density Parity-Check Codes
Haley, D., & Grant, A. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016025 · Cited by 9
New proofs of retrievability using locally decodable codes
Lavauzelle, J., & Levy-dit-Vehel, F. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541611 · Cited by 9
The Secret Life of Keys: On the Calculation of Mechanical Lock Systems
Vömel, C., Lorenzi, F. D., Beer, S., et al. (2017) · SIAM Review · doi:10.1137/15m1030054 · Cited by 9
A complete classification of partial MDS (maximally recoverable) codes with one global parity
Trautmann, A.-L., & Neri, A. (2019) · Advances in Mathematics of Communications · doi:10.3934/amc.2020006 · Cited by 9
Maximally Recoverable Codes with Hierarchical Locality
Nair, A. M., & Lalitha, V. (2019) · National Conference on Communications · doi:10.1109/ncc.2019.8732208 · Cited by 9
On the List Decodability of Insertions and Deletions
Hayashi, T., & Yasunaga, K. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2981321 · Cited by 9
Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices
Zhang, L. G., Huang, Q., Lin, S., et al. (2010) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2010.5454149 · Cited by 9
Topology-Transparent Distributed Scheduling in Multi-Hop Wireless Networks
Sun, Q., Li, V. O. K., & Leung, K.-C. (2008) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.2008.ecp.994 · Cited by 9
Tarnanen, H. (1985) · Discrete Mathematics · doi:10.1016/0012-365x(85)90180-3 · Cited by 9
Binary Linear Locally Repairable CodesPreprint
Huang, P., Yaakobi, E., Uchikawa, H., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.06960 · Cited by 9
“44 in [25]), H ′′ 3 = [1, 1, · · · , 1], and H ′′ 4 = [1, 1, · · · , 1].”
Near MDS poset codes and distributions
Barg, A., & Purkayastha, P. (2010) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/523/10320 · Cited by 9
Zipper Codes: High-rate Spatially-coupled Codes with Algebraic Component Codes
Sukmadji, A. Y. (2020) · TSpace (University of Toronto) · Cited by 9
The minimum order of complete caps in $PG(4,4)$
Bartoli, D., Davydov, A. A., Marcugini, S., et al. (2011) · Advances in Mathematics of Communications · doi:10.3934/amc.2011.5.37 · Cited by 8
Premlal, R., & Rajan, B. S. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3575300 · Cited by 8
Shi, H., Fang, W., & Gao, Y. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3668262 · Cited by 8
An improvement of the Johnson bound for subspace codes
Kiermaier, M., & Kurz, S. (2017) · EPub Bayreuth (University of Bayreuth) · Cited by 8
New self-dual codes from TGRS codes with general $ \ell $ twists
Ding, Y., & Zhu, S. (2024) · Advances in Mathematics of Communications · doi:10.3934/amc.2024017 · Cited by 8
Network Coding on Heterogeneous Multi-Core Processors for Wireless Sensor Networks
Kim, D., Park, K., & Ro, W. W. (2011) · Sensors · doi:10.3390/s110807908 · Cited by 8
1-generator generalized quasi-cyclic codes over ℤ 4 $\mathbb {Z}_{4}$
Wu, T., Gao, J., & Fu, F. (2015) · Cryptography and Communications · doi:10.1007/s12095-015-0175-0 · Cited by 8
Partial Inverses mod $m(x)$ and Reverse Berlekamp–Massey Decoding
Yu, J.-H., & Loeliger, H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2613559 · Cited by 8
Prakash, N., & Médard, M. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2865750 · Cited by 8
Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach
Huang, P., Yaakobi, E., & Siegel, P. H. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2962012 · Cited by 8
A Concise Bounded Anonymous Broadcast Yielding Combinatorial Trace-and-Revoke Schemes
Do, X. D., Phan, D. H., & Yung, M. M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-57878-7_8 · Cited by 8
Drăgoi, V., & Cristescu, G. (2021) · Sensors · doi:10.3390/s21092976 · Cited by 8
On Codes for the Noisy Substring Channel
Yehezkeally, Y., & Polyanskii, N. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517943 · Cited by 7
Power Decoding of Reed–Solomon Codes Revisited
Rosenkilde, J. (2015) · CIM series in mathematical sciences · doi:10.1007/978-3-319-17296-5_32 · Cited by 8
Capacity achieving codes From randomness conductors
Cheraghchi, M. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205931 · Cited by 7
A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes
Diao, Q., Huang, Q., Lin, S., et al. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6034147 · Cited by 8
Some Good Cyclic and Quasi-Twisted Z 4 -Linear Codes.
Aydın, N., & Gulliver, T. A. (2011) · Ars Combinatoria · Cited by 8
Costello, J. D., & Forney, G. D. (2007) · Proceedings of the IEEE · Cited by 8
On algebraic methods in covering radius problems
Honkala, I. S., Litsyn, S. N., & Tietäväinen, A. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60114-7_3 · Cited by 8
Quadratic-Residue Codes and Cyclotomic Fields
Elia, M., & Interlando, J. C. (2006) · Acta Applicandae Mathematicae · doi:10.1007/s10440-006-9042-5 · Cited by 7
van der Geer, G. (1991) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0441-1_10 · Cited by 8
Anderson, I. M., & Honkala, I. S. (2012) · Cited by 8
Coded Fourier TransformPreprint
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.06471 · Cited by 8
On Computing Centroids According to the $p$-Norms of Hamming Distance VectorsPreprint
Chen, J., Hermelin, D., & Sorge, M. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.esa.2019.28 · Cited by 8
Cooperative Regenerating CodesPreprint
Shum, K. W., & Hu, Y. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.6762 · Cited by 8
“. The code length is equal to the number of storage nodes. This can be furnished by Reed-Solomon code for instance, as long as the finite field size q is larger than the total number of storage nodes n [33]. We let G be the n × k generating matrix of an (n,k) MDS code over Fq. For i = 1,2,...,n, let the i-th row of Gbe…”
MethodRethinking the Producer-Consumer Relationship in Modern DRAM-Based Systems
Patel, M., Shahroodi, T., Manglik, A., et al. (2024) · IEEE Access · doi:10.1109/access.2024.3514377 · Cited by 7
Secure partial repair in wireless caching networks with broadcast channels
Gerami, M., Xiao, M. B., Salimi, S., et al. (2015) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2015.7346846 · Cited by 7
Dolev, S., Petig, T., & Schiller, E. M. (2015) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2767386.2767450 · Cited by 7
Correcting grain-errors in magnetic media
Gabrys, R., Yaakobi, E., & Dolecek, L. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620314 · Cited by 7
Adaptive Topology-Transparent Distributed Scheduling in Wireless Networks
Sun, Q., Li, V. O. K., & Leung, K.-C. (2010) · International Conference on Communications · doi:10.1109/icc.2010.5502450 · Cited by 7
On unconditionally binding code-based commitment schemes
Morozov, K., Roy, P. S., & Sakurai, K. (2017) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1145/3022227.3022327 · Cited by 7
Strong Converses are Just Edge Removal Properties
Kosut, O., & Kliewer, J. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2889687 · Cited by 7
Grammatically uniform population initialization for grammar-guided genetic programming
Criado, P. R., Rolanía, D. B., Manrique, D., et al. (2020) · Soft Computing · doi:10.1007/s00500-020-05061-w · Cited by 7
“…problem for these experiments focuses on obtaining the target derivation tree or a similar one, the fitness function compares the sentence encoded in the target derivation tree with the solution encoded by the individual to evaluate based on the definition of the Hamming distance (Roth 2006).”
MethodPrivate Linear Transformation: The Individual Privacy Case
Esmati, N., Heidarzadeh, A., & Sprintson, A. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517762 · Cited by 7
Micheloni, R., Marelli, A., & Ravasio, R. (2008) · Springer eBooks · doi:10.1007/978-1-4020-8391-4_1 · Cited by 7
New invariants for incidence structures
Jungnickel, D., & Tonchev, V. D. (2012) · Designs Codes and Cryptography · doi:10.1007/s10623-012-9636-z · Cited by 7
On the maximality of linear codes
Alderson, T. L., & Gács, A. (2009) · Designs Codes and Cryptography · doi:10.1007/s10623-009-9293-z · Cited by 7
On symmetric/asymmetric Lee distance error control codes and elementary symmetric functions
Tallini, L. G., & Bose, B. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284658 · Cited by 7
On the Coin Weighing Problem with the Presence of Noise
Bshouty, N. H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32512-0_40 · Cited by 7
On encoding symbol degrees of array BP-XOR codes
Paterson, M. B., Stinson, D. R., & Wang, Y. (2015) · Cryptography and Communications · doi:10.1007/s12095-015-0134-9 · Cited by 7
Entropies of Weighted Sums in Cyclic Groups and an Application to Polar Codes
Abbe, E., Li, J., & Madiman, M. (2017) · Entropy · doi:10.3390/e19090235 · Cited by 7
Distributed Computation: Privacy, Straggler Mitigation, and Security Against Colluding Workers
Vaidya, K., & Rajan, B. S. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322092 · Cited by 7
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences
Kovačević, M., & Vukobratović, D. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3134871 · Cited by 7
On generator matrices and parity check matrices of generalized integer codes
Matsui, H. (2013) · Designs Codes and Cryptography · doi:10.1007/s10623-013-9883-7 · Cited by 7
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
Fashandi, S., Gharan, S. O., & Khandani, A. K. (2007) · doi:10.1109/glocom.2007.354 · Cited by 7
Star factorizations of graph products
Bryant, D. E., El‐Zanati, S. I., & Eynden, C. V. (2001) · Journal of Graph Theory · doi:10.1002/1097-0118(200102)36:2 · Cited by 7
On symmetric subgraphs of the 7-cube: an overview
Dejter, I. J. (1994) · Discrete Mathematics · doi:10.1016/0012-365x(92)00128-e · Cited by 7
On optimal linear codes over F5
Maruta, T., Shinohara, M., & Kikui, A. (2008) · Discrete Mathematics · doi:10.1016/j.disc.2008.01.047 · Cited by 7
Securing fuzzy vault schemes through biometric hashing
Örencik, C., Pedersen, T. B., Savaş, E., et al. (2010) · TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES · doi:10.3906/elk-0910-228 · Cited by 7
Kohnert, A., & Kurz, S. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.10.019 · Cited by 7
On MDS Convertible Codes in the Merge Regime
Ramkumar, V., Kong, X., Sai, G. Y., et al. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3675319 · Cited by 6
A class of triple-twisted GRS codes
Meena, K. C., Pachauri, P., Awasthi, A., et al. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01595-y · Cited by 6
Reconciling similar sets of data
Gabrys, R., & Farnoud, F. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282974 · Cited by 6
A novel elementary construction of matching vectors
Yuan, C., Guo, Q., & Kan, H. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.03.008 · Cited by 6
Diversity-Rate Trade-off in Erasure Networks
Gharan, S. O., Fashandi, S., & Khandani, A. K. (2010) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2010.5462025 · Cited by 6
Explicit constructions of finite-length WOM codes
Chee, Y. M., Kiah, H. M., Vard, A., et al. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8007052 · Cited by 6
Erasure Correction of Scalar Codes in the Presence of Stragglers
Raviv, N., Cassuto, Y., Cohen, R., et al. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437322 · Cited by 6
LCD MDS Codes From Cyclic Codes
Fu, Q., Li, R. H., & Guo, L. B. (2019) · Procedia Computer Science · doi:10.1016/j.procs.2019.06.104 · Cited by 6
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes
Shany, Y., & Berman, A. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3140678 · Cited by 6
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding
Shany, Y., & Berman, A. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3263185 · Cited by 6
k-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size
Kruglik, S., Dau, S. H., Kiah, H. M., & Wang, H. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206768 · Cited by 5
Improved bounds for codes correcting insertions and deletions
Yasunaga, K. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01342-1 · Cited by 6
Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions
Sima, J., Raviv, N., & Bruck, J. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3513040 · Cited by 8
WOM codes with uninformed encoder
Horovitz, M., & Yaakobi, E. (2015) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2015.7133105 · Cited by 6
An Expansion Property of Boolean Linear Maps
Wu, Y., Xu, Z., & Zhu, Y. (2016) · Electronic Journal of Linear Algebra · doi:10.13001/1081-3810.3088 · Cited by 6
Exploiting Content Delivery Networks for covert channel communications
Wang, Y., Shen, Y., Jiao, X., et al. (2016) · Computer Communications · doi:10.1016/j.comcom.2016.07.011 · Cited by 6
On the Capacity of Write-Once Memories
Horovitz, M., & Yaakobi, E. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2689034 · Cited by 6
Baseband and Super-Resolution-Passband Reconstructions in Microwave Imaging
Omar, A. S. (2019) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2019.2894427 · Cited by 6
Metadata
- Authors
- Roth, R.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- Corresponding author
- Roth, Ron
- ORCID
- Roth, Ron
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2006-02-23
- OpenAlex
- W2895239415
- Cited by
- 912
- References
- 0
- Citations by year
- 2026: 21 · 2025: 31 · 2024: 45 · 2023: 40 · 2022: 30 · 2021: 46 · 2020: 55 · 2019: 53 · 2018: 65 · 2017: 46 · 2016: 42 · 2015: 52 · 2014: 41 · 2013: 54 · 2012: 67
- FWCI
- 11.57
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Keywords
- error-correcting codes, Reed-Solomon codes, linear codes, finite fields, cyclic codes, MDS codes, graph codes, concatenated codes, trellis codes, convolutional codes, Reed-Muller codes, burst error correction, decoding algorithms, data transmission reliability, data storage reliability
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
