Cited by 923Coding theory and cryptographyError Correcting Code TechniquesAdvanced Data Storage Technologies

The DOI matches its Crossref record.

Introduction to Coding Theory

Roth, Ron·2006·Cambridge University Press eBooks

Open this paper in CoChat — free account

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.

Integrity signals

Registry

Crossref · 10.1017/cbo9780511808968

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Sorted by citations

Items 401–500 of 923

Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application
Huang, P., Liu, Y., Zhang, X., et al. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2966439 · Cited by 6
On connectivity-dependent resource requirements for digital quantum simulation of d-level particles
Sawaya, N. P. D., Guerreschi, G. G., & Holmes, A. A. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00031 · Cited by 9
Managing Noise and Interference Separately - Multiple Access Channel Decoding using Soft GRAND
Solomon, A., Duffy, K. R., & Médard, M. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517890 · Cited by 6
Codes over Lattice‐Valued Intuitionistic Fuzzy Set Type‐3 with Application to the Complex DNA Analysis
Riaz, A., Kousar, S., Kausar, N., et al. (2022) · Complexity · doi:10.1155/2022/5288187 · Cited by 6
Private Information Retrieval from Multiple Access Channels
Banawan, K., & Ulukuş, Ş. (2018) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2018.8613517 · Cited by 6
Explicit and Efficient WOM Codes of Finite Length
Chee, Y. M., Kiah, H. M., Vardy, A., et al. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2946483 · Cited by 6
On the Stopping Distance and Stopping Redundancy of Product Codes
Hivadi, M., & ESMAEILI, M. (2008) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e91-a.8.2167 · Cited by 6
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
Kim, J.-L., & Kim, S. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.07.022 · Cited by 6
Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes
Cohen, G., & Ta‐Shma, A. (2013) · Cited by 6
Incremental Redundancy, Fountain Codes and Advanced TopicsPreprint
Arslan, Ş. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.6016 · Cited by 6
Nonadaptive group testing with random set of defectives via constant-weight codesPreprint
Mazumdar, A. (2015) · arXiv (Cornell University) · Cited by 6
Rank Metric Convolutional Codes with Applications in Network Streaming
Mahmood, R. (2015) · TSpace (University of Toronto) · Cited by 6
On Coding over Sliced InformationPreprint
Sima, J., Raviv, N., & Bruck, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.02716 · Cited by 6
DEEP-FRI: Sampling Outside the Box Improves SoundnessPreprint
Ben‐Sasson, E., Goldberg, L., Kopparty, S., et al. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2020.5 · Cited by 6
FireLedger: A High Throughput Blockchain Consensus ProtocolPreprint
Buchnik, Y., & Friedman, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.03279 · Cited by 6
Performance and Decoding Complexity Analysis of Short Binary Codes
Lian, B. (2019) · TSpace (University of Toronto) · Cited by 5
Algebraic geometry codes and some applicationsPreprint
Couvreur, A., & Randriambololona, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.01281 · Cited by 8
Codes for Identification via Channels: Tutorial for Communications Generalists
von Lengerke, C., Cabrera, J. A., Martin Reisslein, B., & Fitzek, F. H. P. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3579815 · Cited by 5
Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians
Bookatz, A. D., Roetteler, M., & Wocjan, P. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2535183 · Cited by 5
New results on asymmetric orthogonal arrays with strength t ≥ 3
Niu, X., Chen, G., Gao, Q., et al. (2024) · Discrete Mathematics · doi:10.1016/j.disc.2024.114264 · Cited by 5
A Hamada type characterization of the classical geometric designs
Jungnickel, D., & Tonchev, V. D. (2011) · Designs Codes and Cryptography · doi:10.1007/s10623-011-9580-3 · Cited by 5
On quantum SPC product codes
Hivadi, M. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2095-3 · Cited by 5
MDS coding is better than replication for job completion times
Duffy, K. R., & Shneer, S. (2019) · Maynooth University ePrints and eTheses Archive (Maynooth University) · doi:10.48550/arxiv.1907.11052 · Cited by 5
“In the network setting, the replication-d strategy is similar in spirit to repetition coding [18], which is known to be sub-optimal, and instead we consider a MDS (Maximum Distance Separable) approach.”
Method
Fault-Tolerant Neuromorphic Computing on Nanoscale Crossbar Architectures
Roth, R. M. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965851 · Cited by 5
Self-citation
Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds
Shivakrishna, D., Nair, A. M., & Lalitha, V. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3212076 · Cited by 5
Twisted Goppa Codes With an Efficient Decoding Algorithm and Quasi-Cyclic Properties
Sui, J., & Yue, Q. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3271652 · Cited by 5
Enumeration of Cyclic Codes Over GF(23)
Simatwo, K. B., Mati, R. F., & Karieko, O. R. (2023) · Journal of Advances in Mathematics and Computer Science · doi:10.9734/jamcs/2023/v38i91815 · Cited by 5
Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
Qiang, S., Wei, H., & Hong, S. (2025) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2025.102616 · Cited by 5
Parity Check based redistribution of secret shares
Desmedt, Y., & Morozov, K. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282597 · Cited by 5
List decoding of crisscross error patterns
Wachter-Zeh, A. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875030 · Cited by 5
Efficient compression of monotone and m-modal distributions
Acharya, J., Jafarpour, A., Orlitsky, A., et al. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875157 · Cited by 5
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
Ding, Y., Jin, L., & Xing, C. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2314468 · Cited by 5
A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
Trinker, H. (2008) · Designs Codes and Cryptography · doi:10.1007/s10623-008-9226-2 · Cited by 5
Reverse Berlekamp-Massey decoding
Yu, J.-H., & Loeliger, H. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620419 · Cited by 5
A note on the relation between a sampling theorem for functions over a GF(q)n domain and linear codes
Ukita, Y., Saitoh, T., Matsushima, T., et al. (2009) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2009.5346131 · Cited by 5
The Key Equation for One-Point Codes
O’Sullivan, M. E., & Bras-Amorós, M. (2008) · Series on coding theory and cryptology · doi:10.1142/9789812794017_0003 · Cited by 5
BCH Codes for the Rosenbloom–Tsfasman Metric
Zhou, W., Lin, S., & Abdel-Ghaffar, K. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2617312 · Cited by 5
Decoding of Interleaved Alternant Codes
Holzbaur, L., Liu, H., Neri, A., et al. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3115432 · Cited by 5
Private Linear Transformation: The Joint Privacy Case
Esmati, N., Heidarzadeh, A., & Sprintson, A. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518099 · Cited by 5
Secure Codes With Accessibility for Distributed Storage
Holzbaur, L., Kruglik, S., Frolov, A., et al. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3128822 · Cited by 5
Invariant codes, difference schemes, and distributive quasigroups
Castoldi, A. G., Martinhão, A. N., Carmelo, E. L. M., et al. (2022) · Computational and Applied Mathematics · doi:10.1007/s40314-022-02069-w · Cited by 5
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes
Kruglik, S., Luo, G., Kim, W., et al. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206718 · Cited by 5
Codes Correcting a Single Long Duplication Error
Goshkoder, D., Polyanskii, N., & Vorobyev, I. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206675 · Cited by 4
The Minimum Distance of Graph Codes
Høholdt, T., & Justesen, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20901-7_12 · Cited by 5
Privacy-preserving population-enhanced biometric key generation from free-text keystroke dynamics
Šeděnka, J., Balagani, K. S., Phoha, V. V., et al. (2014) · IEEE International Joint Conference on Biometrics (IJCB) · doi:10.1109/btas.2014.6996244 · Cited by 5
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits
Bakshi, M., Jaggi, S., Cai, S., et al. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2466601 · Cited by 5
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
van Melkebeek, D. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1589 · Cited by 5
A Linear Programming bound for Unequal Error Protection codes
Saito, T., Ukita, Y., Matsushima, T., et al. (2010) · Australian Communications Theory Workshop · doi:10.1109/ausctw.2010.5426756 · Cited by 5
Coding for high-density magnetic recording
Mazumdar, A., Barg, A., & Kashyap, N. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513783 · Cited by 5
Limits to list decoding of insertions and deletions
Wachter-Zeh, A. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006869 · Cited by 5
Constructions of augmented orthogonal arrays
Wang, X., Ji, L., Li, Y., et al. (2018) · Journal of Combinatorial Designs · doi:10.1002/jcd.21624 · Cited by 5
Tight embeddings of partial quadrilateral packings
Füredi, Z., & Lehel, J. (2009) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2009.06.003 · Cited by 5
Sparse recovery and fourier sampling
Indyk, P., & Price, E. (2013) · Cited by 5
Generalized skew reed-solomon codes and other applications of skew polynomial evaluation
Liu, S. (2016) · TSpace (University of Toronto) · Cited by 5
On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side InformationPreprint
Heidarzadeh, A., Garcia, B., Kadhe, S., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.09908 · Cited by 5
HMOG: New Behavioral Biometric Features for Continuous Authentication of Smartphone UsersPreprint
Sitová, Z., Šeděnka, J., Yang, Q., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.01199 · Cited by 5
An algebraic approach for the resolution of algorithmic problems raised by cryptography and coding theory
Drăgoi, V. (2017) · doi:10.70675/768c8e60zc3e6z4c17za728zec57125eed6b · Cited by 5
Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
Hareesh, K., T., R. U. N., & Rajan, B. S. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3697793 · Cited by 4
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
Cadambe, V. R., Lynch, N. A., Médard, M., et al. (2013) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 4
A Family of Binary Locally Repairable Codes for Coded Distributed Computing
Qharabagh, M. F., & Ardakani, M. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3322174 · Cited by 4
Decoding Algorithms of Twisted GRS Codes and Twisted Goppa Codes
Sun, H., Yue, Q., Jia, X., et al. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3509895 · Cited by 4
A new path to code-based signatures via identification schemes with restricted errors
Baldi, M., Battaglioni, M., Chiaraluce, F., Trautmann, A.-L., Persichetti, E., Santini, P. M., & Weger, V. (2025) · Advances in Mathematics of Communications · doi:10.3934/amc.2024058 · Cited by 4
Zero-Knowledge Protocols for Code-Based Public-Key Encryption
Hu, R. L., Morozov, K., & Takagi, T. (2015) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e98.a.2139 · Cited by 4
D-optimal augmented designs and the existence of tight orthogonal arrays with high strength
Wang, J., & Yue, R. (2021) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2021.08.005 · Cited by 4
On the construction of nested orthogonal arrays with the adjacent numbers of levels
Pang, S., & Zhu, Y. P. (2024) · Stat · doi:10.1002/sta4.666 · Cited by 4
Error-Detection Schemes for Analog Content-Addressable Memories
Roth, R. M. (2024) · IEEE Transactions on Computers · doi:10.1109/tc.2024.3386065 · Cited by 4
Self-citation
Strong Polarization for Shortened and Punctured Polar Codes
Shuval, B., & Tal, I. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619268 · Cited by 4
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm
Bras-Amorós, M., & O’Sullivan, M. E. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02181-7_4 · Cited by 4
An Efficient Encoding Algorithm for (n, k) Binary Cyclic Codes
Qamar, R. A., Maarof, M. A., & Ibrahim, S. (2012) · doi:10.17485/ijst/2012/v5i5/30458 · Cited by 4
New ternary linear codes from projectivity groups
Pace, N. (2014) · Discrete Mathematics · doi:10.1016/j.disc.2014.04.027 · Cited by 4
Some results on the differential functions over finite fields
Xiong, H., Qu, L., Li, C., et al. (2014) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-014-0220-9 · Cited by 4
Invariant sets under linear operator and covering codes over modules
dos Santos, O. J. N. T. N., & Carmelo, E. L. M. (2013) · Linear Algebra and its Applications · doi:10.1016/j.laa.2013.11.034 · Cited by 4
Performance Improvement of Coded OFDM Communication System in AWGN Channel
AbdelfatahAbdeltwab, M., El-Barbary, K., & El-Henawy, A. (2015) · International Journal of Computer Applications · doi:10.5120/19361-0969 · Cited by 4
Alphabet-size dependent bounds for exact repair in distributed storage
Cadambe, V. R., & Mazumdar, A. (2015) · doi:10.1109/itwf.2015.7360722 · Cited by 4
Constructions and Bounds for Batch Codes with Small Parameters
Thomas, E. K., & Skachek, V. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66278-7_24 · Cited by 4
The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol
Kumar, V. B., Antony, R., & Kashyap, N. (2018) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · Cited by 4
Analog Error-Correcting Codes
Roth, R. M. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849843 · Cited by 4
Self-citation
Communication-Efficient Signature-Free Asynchronous Byzantine Agreement
Li, F., & Chen, J. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518010 · Cited by 4
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels
Rameshwar, V. A., & Kashyap, N. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3296207 · Cited by 4
New results on orthogonal arrays OA(3,5,4n + 2)
Li, D., & Cao, H. (2024) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2024.105864 · Cited by 4
Steganographic schemes with multiple q-ary changes per block of pixels
Gholampour, I., & Khosravi, K. (2014) · Signal Processing · doi:10.1016/j.sigpro.2014.09.008 · Cited by 4
On Some New $\mathbb{Z}_{m}$ Linear Codes Based on Elementary Symmetric Functions
Tallini, L. G., & Bose, B. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437336 · Cited by 4
r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube
Dhanalakshmi, R., & Durairajan, C. (2019) · Discrete Mathematics Algorithms and Applications · doi:10.1142/s1793830919500277 · Cited by 4
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers
Jinan, R., Badita, A., Sarvepalli, P. K., & Parag, P. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3152182 · Cited by 4
Efficient Distributed Source Coding of Fragmented Genomic Sequencing Data
Gershon, Y., & Cassuto, Y. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518191 · Cited by 4
Correcting deletion errors in DNA data storage with enzymatic synthesis
Tang, Y., & Farnoud, F. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw48936.2021.9611403 · Cited by 4
Estimating the Sizes of Binary Error-Correcting Constrained Codes
Rameshwar, V. A., & Kashyap, N. (2023) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2023.3279113 · Cited by 4
A Shared Steganographic File System with Error Correction
Domingo‐Ferrer, J., & Bras-Amorós, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88269-5_21 · Cited by 4
MULTIVARIATE LIST DECODING OF EVALUATION CODES WITH A GRÖBNER BASIS PERSPECTIVE
Busse, P. (2008) · UKnowledge (University of Kentucky) · Cited by 4
Bounded-Contention Coding for the additive network model
Censor-Hillel, K., Haeupler, B., Lynch, N. A., et al. (2015) · Distributed Computing · doi:10.1007/s00446-015-0244-9 · Cited by 4
Results on binary cyclic codes
Tjhai, C. J., & Tomlinson, M. (2007) · Electronics Letters · doi:10.1049/el:20073898 · Cited by 4
On Zero-Knowledge Identification Based on Q-ary Syndrome Decoding
Hu, R. L., Morozov, K., & Takagi, T. (2013) · Asia Joint Conference on Information Security (AsiaJCIS) · doi:10.1109/asiajcis.2013.10 · Cited by 4
Prefactor Reduction of the Guruswami–Sudan Interpolation Step
Senger, C. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2361347 · Cited by 4
On the equivalence of linear codes
Liu, Z., & Sun, Z. (2011) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-011-0142-8 · Cited by 4
Diffusive primitives in THE design of modern cryptographic algorithms
Jamel, S. H., & Deris, M. M. (2008) · International Conference on Computer and Communication Engineering · doi:10.1109/iccce.2008.4580696 · Cited by 4
Complete (q 2 + q + 8)/2-caps in the spaces PG(3, q), q ≡ 2 (mod 3) an odd prime, and a complete 20-cap in PG(3, 5)
Davydov, A. A., Marcugini, S., & Pambianco, F. (2008) · Designs Codes and Cryptography · doi:10.1007/s10623-008-9237-z · Cited by 4
Comparative Study of Data Transmission Techniques of Different Block Codes over AWGN Channel using Simulink
B.C.E.T, G., Singh, J., & Bahel, S. (2014) · International Journal of Engineering Trends and Technology · doi:10.14445/22315381/ijett-v9p316 · Cited by 4
Asymptotically good families of subfield subcodes of geometric Goppa codes
Voß, C., & Stichtenoth, H. (1990) · Geometriae Dedicata · doi:10.1007/bf00147606 · Cited by 4
On strongly tactical codes
Gundlach, M. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16776-5_705 · Cited by 4
Binary caps with many free pairs of points
Lisoněk, P. (2006) · Journal of Combinatorial Designs · doi:10.1002/jcd.20117 · Cited by 4

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
DOI: 10.1017/cbo9780511808968
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
Licence: www.cambridge.org/core/terms (unspecified, 2294 d)
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

Introduction to Coding Theory

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Citations

Cited by

Related

Metadata

Record

About these checks