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 501–600 of 923

Coded Caching Schemes with Reduced Subpacketization from Linear Block CodesPreprint
Tang, L., & Ramamoorthy, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.00101 · Cited by 4
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory EmulationPreprint
Cadambe, V. R., Wang, Z., & Lynch, N. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.06844 · Cited by 4
Protocols for Reliable and Secure Message Transmission.Preprint
Choudhury, A. (2010) · IACR Cryptology ePrint Archive · Cited by 4
NP-Complete Problems for Lee Metric CodesPreprint
Weger, V., Santini, P., Battaglioni, M., et al. (2020) · arXiv (Cornell University) · Cited by 4
On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3Preprint
Davydov, A. A., Marcugini, S., & Pambianco, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.02405 · Cited by 4
Single-Server Private Linear Transformation: The Individual Privacy CasePreprint
Heidarzadeh, A., Esmati, N., & Sprintson, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.05222 · Cited by 4
The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
Shany, Y., & Berman, A. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3522185 · Cited by 3
Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
Meena, K. C., Bhaintwal, M., Awasthi, A., et al. (2025) · Cryptography and Communications · doi:10.1007/s12095-025-00822-6 · Cited by 3
Building Capacity-Achieving T-PIR Schemes for Some Parameters Over Binary Field via Subfield Sub-Codes
Jingke, X., & Wang, L. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3125056 · Cited by 3
Codes for the Asymmetric Damerau–Levenshtein Distance
Wang, S., Vu, V. K., & Tan, V. Y. F. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965921 · Cited by 3
A class of constacyclic codes are generalized Reed–Solomon codes
Liu, H., & Liu, S. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01294-6 · Cited by 3
Codes Correcting Long Duplication Errors
Goshkoder, D., Polyanskii, N., & Vorobyev, I. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3403755 · Cited by 4
Non-Reed-Solomon Type Cyclic MDS Codes
Li, F., Chen, Y., Chen, H., et al. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3538220 · Cited by 3
On (ℒ, 𝒫)-Twisted Generalized Reed-Solomon Codes
Hu, Z., Wang, L., Li, N., et al. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3610149 · Cited by 3
Adaptive Generation of Unique IDs for Digital Chips through Analog Excitation
Suresh, C. K. H., Ozev, S., & Sinanoglu, O. (2015) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/2732408 · Cited by 3
Analysis and Implementation of an Efficient Ring-LPN Based Commitment Scheme
Lipmaa, H., & Pavlyk, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26823-1_12 · Cited by 3
A capacity-achieving coding scheme for the AWGN channel with polynomial encoding and decoding complexity
Vatedka, S., & Kashyap, N. (2016) · National Conference on Communications · doi:10.1109/ncc.2016.7561091 · Cited by 3
Leveraging Privacy In Data Analysis
Rogers, R. (2017) · ScholarlyCommons (University of Pennsylvania) · Cited by 3
Private information retrieval from Byzantine and colluding databases
Banawan, K., & Ulukuş, Ş. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262859 · Cited by 3
On Spectral Design Methods for Quasi-Cyclic Codes
Roth, R. M., & Zeh, A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2880908 · Cited by 3
Self-citation
A New Super-Resolution Technique for Direction (and Time) of Arrival Detection
Omar, A. S. (2018) · European Radar Conference (EuRAD) · doi:10.23919/eurad.2018.8546553 · Cited by 3
Generation of Perfectly DC Balanced Codes for Visible Light Communications
Uday, T., Kumar, A., & Natarajan, L. P. (2018) · National Conference on Communications · doi:10.1109/ncc.2018.8600070 · Cited by 3
Nearly Optimal Robust Secret Sharing.
Cheraghchi, M. (2015) · Cited by 3
On IND-CCA1 Security of Randomized McEliece Encryption in the Standard Model
Farro, F. A., & Morozov, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25922-8_8 · Cited by 3
On Codes for the Noisy Substring Channel
Yehezkeally, Y., & Polyanskii, N. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3382499 · Cited by 3
Quadratic Secret Sharing and Conditional Disclosure of Secrets
Beimel, A., Othman, H., & Peter, N. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3296588 · Cited by 3
Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise
Gelles, R., Kalai, Y. T., & Ramnarayan, G. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3160515 · Cited by 3
On the construction of some new asymmetric orthogonal arrays
Zhang, Q., Li, Y., Pang, S., et al. (2022) · Communication in Statistics- Theory and Methods · doi:10.1080/03610926.2022.2083166 · Cited by 3
Generalized Inverse Based Decoding
Ţiplea, F. L., & Drăgoi, V. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834696 · Cited by 4
Reed–Solomon Codes over Fields of Characteristic Zero
Sippel, C., Ott, C., Puchinger, S., et al. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849332 · Cited by 3
Power error locating pairs
Couvreur, A., & Panaccione, I. (2020) · Designs Codes and Cryptography · doi:10.1007/s10623-020-00774-3 · Cited by 3
Guessing Based on Compressed Side Information
Graczyk, R., Lapidoth, A., Merhav, N., et al. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3158475 · Cited by 3
Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $
Davydov, A. A., Marcugini, S., & Pambianco, F. (2022) · Advances in Mathematics of Communications · doi:10.3934/amc.2021074 · Cited by 3
Genomic Compression With Read Alignment at the Decoder
Gershon, Y., & Cassuto, Y. (2023) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2023.3300831 · Cited by 3
Quantum‐Accelerated Algorithms for Generating Random Primitive Polynomials Over Finite Fields
Huang, S., Yin, H., Chen, Z., & Wu, S. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300302 · Cited by 4
A transform approach for constructing quasi-cyclic Euclidean geometry LDPC codes
Diao, Q., Zhou, W. G., Lin, S. H., et al. (2012) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2012.6181800 · Cited by 3
Volume ratio, sparsity, and minimaxity under unitarily invariant norms
Ma, Z., & Wu, Y. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620382 · Cited by 3
The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic
Honold, T., & Kiermaier, M. (2012) · Designs Codes and Cryptography · doi:10.1007/s10623-012-9653-y · Cited by 3
Hadamard tensors and lower bounds on multiparty communication complexity
Ford, J., & Gál, A. (2012) · Computational Complexity · doi:10.1007/s00037-012-0052-6 · Cited by 3
Error-Correction of Multidimensional Bursts
Yaakobi, E., & Etzion, T. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557415 · Cited by 3
On the dimension of graph codes with Reed-Solomon component codes
Beelen, P., Høholdt, T., Piñero, F., et al. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620422 · Cited by 3
Multilevel Reed–Solomon Codes for PMR Channels
Demirkan, İ., & Silvus, G. L. (2015) · IEEE Transactions on Magnetics · doi:10.1109/tmag.2015.2495158 · Cited by 3
A study on complexity reduction of the reliability-based maximum likelihood decoding algorithm for block codes
八木, 秀. (2005) · Medical Entomology and Zoology · Cited by 3
SEARCH FOR GOOD LINEAR CODES IN THE CLASS OF QUASI-CYCLIC AND RELATED CODES
Aydın, N., & Asamov, T. (2010) · Series on coding theory and cryptology · doi:10.1142/9789812837172_0007 · Cited by 3
A p-ary MDPC scheme
Guo, Q., & Johansson, T. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541520 · Cited by 3
A new coding scheme for fault tolerant 4-phase delay-insensitive codes
Huemer, F., Lechner, J., & Steininger, A. (2016) · Proceedings, IEEE International Conference on Computer Design/Proceedings - IEEE International Conference on Computer Design · doi:10.1109/iccd.2016.7753311 · Cited by 3
Implicit effect of decoding time on fault tolerance in erasure coded Cloud Storage systems
Safaei, B., Miremadi, S. G., & Chamazcoti, S. A. (2016) · International Computer Science and Engineering Conference · doi:10.1109/icsec.2016.7859937 · Cited by 3
Syndrome-coupled rate-compatible error-correcting codes
Huang, P., Liu, Y., Zhang, X., et al. (2017) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2017.8277969 · Cited by 3
Confidentiality and Integrity for IoT/Mobile Networks
Minh, T. N. (2019) · IntechOpen eBooks · doi:10.5772/intechopen.88011 · Cited by 3
Some features of binary block codes for correcting asymmetric errors
Fang, G., van Tilborg, H. C. A., Sun, F. W., et al. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56686-4_37 · Cited by 3
On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder CodesPreprint
Yu, J.-H. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.5413 · Cited by 3
Applications of balance equations to vertex switching reconstruction
Krasikov, I. (1994) · Journal of Graph Theory · doi:10.1002/jgt.3190180302 · Cited by 3
A contribution to the theory of convolutional codes from systems theory piont of view
Um, L. E. (2015) · doi:10.5821/dissertation-2117-95779 · Cited by 3
Query Complexity and Error Tolerance of Witness Finding Algorithms.Preprint
Kawachi, A., Rossman, B., & Watanabe, O. (2012) · Electronic colloquium on computational complexity · Cited by 3
List-decoding of binary Goppa codes up to the binary Johnson boundPreprint
Augot, D., Barbier, M., & Couvreur, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.3439 · Cited by 3
Compressive Sensing with Local Geometric FeaturesPreprint
Gupta, R., Indyk, P., Price, E., et al. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.2447 · Cited by 3
New Constructions of MDS Twisted Reed-Solomon Codes and LCD MDS CodesPreprint
Liu, H., & Liu, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.03708 · Cited by 3
“,αn) and v = (v1,v2··· ,vn) be two vectors of length n over Fq. We deﬁne the evaluation map related to α and v as follows: evα,v : Fq[x] → F n q , f(x) → (v1f(α1),v2f(α2),...,vnf(αn)). Deﬁnition 2.1. [24] Let α1,...,αn ∈ Fq S {∞} be distinct elements, k < n, and v1,...,vn ∈ F∗ q. The corresponding generalized Reed-…”
BackgroundInfluential
Unique Decoding of Explicit $ε$-balanced Codes Near the Gilbert-Varshamov BoundPreprint
Jeronimo, F. G., Quintana, D., Srivastava, S., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.05500 · Cited by 3
Cryptanalysis of the Fuzzy Vault for Fingerprints: Vulnerabilities and Countermeasures
Tams, B.-B. (2013) · doi:10.53846/goediss-3924 · Cited by 3
Improved Information Set Decoding Algorithms over Galois Ring in the Lee Metric
Li, Y., & Wang, L. (2023) · Journal of Systems Science and Complexity · doi:10.1007/s11424-023-1512-6 · Cited by 2
Invertible Bloom Lookup Tables with Listing Guarantees
Mizrahi, A., Bar-Lev, D., Yaakobi, E., et al. (2024) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3673660.3655060 · Cited by 2
Decoding Sparse Reed-Solomon Codes with Known Support
Kim, W., Raj, J. N., Kruglik, S., et al. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619533 · Cited by 2
New results on optimal 2-level orthogonal arrays with repeated rows
Cui, F., Gao, Q., & Chen, G. (2025) · Statistics & Probability Letters · doi:10.1016/j.spl.2025.110476 · Cited by 2
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes
Wang, G., Liu, H., & Luo, J. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3594174 · Cited by 2
Signaling over the Gaussian channel with intermittent feedback
Palzer, L. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282904 · Cited by 2
Improved burst error correction via list decoding quasi-cyclic codes
Zeh, A., & Roth, R. M. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282408 · Cited by 2
Self-citation
GestureFlow: QoE-Aware Streaming of Multi-TouchGestures in Interactive Multimedia Applications
Feng, Y., Liu, Z., & Li, B. (2012) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2012.120813 · Cited by 2
Tradeoffs between jamming resilience and communication efficiency in key establishment
Slater, D., Poovendran, R., Tague, P., et al. (2009) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1558590.1558593 · Cited by 2
Asymptotically Optimal Regenerating Codes Over Any Field
Raviv, N. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006762 · Cited by 2
Hierarchical erasure correction of linear codes
Raviv, N., Schwartz, M., Cohen, R., et al. (2020) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2020.101743 · Cited by 2
“The above construction is closely related to a classical coding theoretic notion called alternant codes [13, Sec.”
Background
The minimum Hamming distances of repeated-root cyclic codes of length $$6p^s$$ and their MDS codes
Gao, Y., Yue, Q., & Li, F. (2020) · Journal of Applied Mathematics and Computing · doi:10.1007/s12190-020-01383-y · Cited by 2
Bounds on Mixed Codes with Finite Alphabets
Yehezkeally, Y., Kim, H. A., Puchinger, S., et al. (2023) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw55543.2023.10161655 · Cited by 2
Generic Error SDP and Generic Error CVE
Manganiello, F., & Slaughter, F. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-46495-9_7 · Cited by 2
Linear Codes for Hyperdimensional Computing
Raviv, N. (2024) · Neural Computation · doi:10.1162/neco_a_01665 · Cited by 2
Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List Decoding Capacity
Berman, A., Shany, Y., & Tamo, I. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3575899 · Cited by 2
Invariance vs. Robustness Trade-Off in Neural Networks
Kamath, S., Deshpande, A., & Subrahmanyam, K. V. (2020) · Cited by 2
On cyclic caps in 4-dimensional projective spaces
Giulietti, M. (2007) · Designs Codes and Cryptography · doi:10.1007/s10623-007-9106-1 · Cited by 2
Multilevel interleaved Reed-Solomon codes using soft information for magnetic recording channels
Demirkan, İ., & Silvus, G. L. (2014) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/iccnc.2014.6785321 · Cited by 2
A Processor Accelerator for Software Decoding of BCH Codes
Ito, K. (2010) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e93.a.1329 · Cited by 2
Remarks on polarity designs
Ghinelli, D., Jungnickel, D., & Metsch, K. (2012) · Designs Codes and Cryptography · doi:10.1007/s10623-012-9748-5 · Cited by 2
An upper bound on the separating redundancy of linear block codes
Abdel-Ghaffar, K., & Weber, J. H. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513667 · Cited by 2
Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation
Augot, D., Fouque, P.-A., & Karpman, P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13051-4_15 · Cited by 2
Burst List Decoding of Interleaved Reed–Solomon Codes
Kolan, T., & Roth, R. M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2287477 · Cited by 2
Self-citation
Hiding Symbols and Functions: New Metrics and Constructions for Information-Theoretic Security
Calmon, F. P., Médard, M., Varia, M., et al. (2015) · Maynooth University ePrints and eTheses Archive (Maynooth University) · doi:10.48550/arxiv.1503.08513 · Cited by 2
Application of Module Structure of Algebra in Coding Theory in Different Branches of Engineering
Sinha, A. K. (2013) · International Journal of Scientific Engineering and Technology · Cited by 2
Code-Based Public-Key Encryption
Morozov, K. (2014) · Mathematics for industry · doi:10.1007/978-4-431-55060-0_4 · Cited by 2
GROEBNER BASES FOR QUATERNARY CODES
Leppert, R., Saleemi, M., & Zimmermann, K.-H. (2011) · tub.dok (Hamburg University of Technology) · Cited by 2
Coding for combined block-symbol error correction
Roth, R. M., & Vontobel, P. O. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620420 · Cited by 2
Self-citation
Ladder Codes: A Class of Error-Correcting Codes with Multi-Level Shared Redundancy
Huang, P., Yaakobi, E., & Siegel, P. H. (2018) · International Conference on Communications · doi:10.1109/icc.2018.8422903 · Cited by 2
The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol
Kumar, B. R. V., Kashyap, N., & Antony, R. (2018) · National Conference on Communications · doi:10.1109/ncc.2018.8599936 · Cited by 2
Noisy Private Information Retrieval
Banawan, K., & Ulukuş, Ş. (2018) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2018.8645465 · Cited by 2
Flicker Mitigating High Rate RLL Codes for VLC with Low Complexity Encoding and Decoding
Uday, T., Kumar, A., & Natarajan, L. P. (2018) · IEEE International Symposium on Smart Electronic Systems (iSES) · doi:10.1109/ises.2018.00053 · Cited by 2
A method to find the volume of a sphere in the Lee metric, and its applications
Bhattacharya, S., & Banerjee, A. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849817 · Cited by 2
Testing Problems. Testing as a Coding of Knowledge System
Serdyukova, N. A., & Serdyukov, V. I. (2020) · Intelligent systems reference library · doi:10.1007/978-3-030-54470-6_5 · Cited by 2
High-Performance Solid State Drive with Parallel Read Scheme
Berman, A. L. (2020) · doi:10.1109/nvmsa51238.2020.9188230 · Cited by 2
New Perspectives on Recognition Performance of Daugman’s IrisCode or “Everything is New–it is Well Forgotten Old”
Zuo, J., Hampel, K. M., & Schmid, N. A. (2021) · IEEE Access · doi:10.1109/access.2021.3130100 · Cited by 2
Weighted Matchings
Jungnickel, D. (2012) · Algorithms and computation in mathematics · doi:10.1007/978-3-642-32278-5_14 · Cited by 2
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes
Rameshwar, V. A., Jain, S., & Kashyap, N. (2024) · National Conference on Communications · doi:10.1109/ncc60321.2024.10485899 · Cited by 2
Bounds on the Maximum Cardinality of Indel and Substitution Correcting Codes
Spee, W. J. P., & Weber, J. H. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3388971 · Cited by 2
Error Correction Decoding for Underwater Acoustic Tag Detection
Hall, J. W., Zheng, Y. R., & Deng, Z. D. (2019) · OCEANS MTS/IEEE Conference (OCEANS) · doi:10.23919/oceans40490.2019.8962581 · Cited by 2

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