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 701–800 of 923
Yamakami, T. (2016) · Baltic Journal of Modern Computing · doi:10.22364/bjmc.2016.4.4 · Cited by 1
Interpolation-based Decoding of Alternant CodesPreprint
Lee, K. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0702118 · Cited by 1
Efficient Arithmetic on Subfield Elliptic Curves over Small Finite Fields of Odd Characteristic
Hakuta, K., Hisayoshi, S. A. T. O., & Takagi, T. (2008) · Springer eBooks · doi:10.1007/978-3-540-79104-1_22 · Cited by 1
On the pseudocodeword redundancy
Zumbrägel, J., Flanagan, M. F., & Skachek, V. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513618 · Cited by 1
Prime cyclic arithmetic codes and the distribution of power residues
Clark, W. E., & Lewis, L. W. (1989) · Journal of Number Theory · doi:10.1016/0022-314x(89)90027-9 · Cited by 1
Cooperative Repair of Multiple Node Failures in Distributed Storage SystemsPreprint
Shum, K. W., & Chen, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.08322 · Cited by 1
SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bitsPreprint
Bakshi, M., Jaggi, S., Cai, S., et al. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.2335 · Cited by 1
On improving the performance of mobile applications using the cloud
Li, B., & Feng, Y. (2013) · Cited by 1
Balagani, K. S., Phoha, V. V., & Gasti, P. (2016) · Cited by 1
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication
Zhang, L. (2017) · TSpace (University of Toronto) · Cited by 1
On the List Decodability of Insertions and DeletionsPreprint
Hayashi, T., & Yasunaga, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.06091 · Cited by 1
McEliece-type Cryptosystems over Quasi-cyclic CodesPreprint
Kapshikar, U. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.09972
Coding sets with asymmetric informationPreprint
Andoni, A., Ghaderi, J., Hsu, D., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.04875 · Cited by 1
A Biologically Plausible Mechanism to Learn Clusters of Neural ActivityPreprint
Loback, A., & Berry, M. J. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/389155 · Cited by 1
Maximally Recoverable Codes with Hierarchical LocalityPreprint
Nair, A. M., & Lalitha, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.02867 · Cited by 1
Loback, A., Prentice, J., Ioffe, M. L., & Berry, M. J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.06886 · Cited by 2
On Finite Alphabet Compressive SensingPreprint
Das, A. K., & Vishwanath, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.3943 · Cited by 1
Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel ChannelsPreprint
Hof, E., Sason, I., Shamai, S. S., et al. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.2770 · Cited by 1
Bounded-Contention Coding for Wireless Networks in the High SNR RegimePreprint
Censor-Hillel, K., Haeupler, B., Lynch, N. A., et al. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.6125 · Cited by 1
On Decoding and Applications of Interleaved Goppa CodesPreprint
Holzbaur, L., Liu, H., Puchinger, S., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.10202 · Cited by 1
CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure CodingPreprint
Cadambe, V. R., & Lyu, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.13310 · Cited by 1
Maximally Recoverable Codes with Hierarchical Locality: Constructions and Field-Size BoundsPreprint
Shivakrishna, D., Nair, A. M., & Lalitha, V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.03328 · Cited by 1
On the minimum length of linear codes of dimension 5
Cheon, E. J., Kim, S. J., Kuranaka, W., et al. (2024) · Discrete Mathematics · doi:10.1016/j.disc.2024.114324 · Cited by 1
Simultaneous Rational Function Reconstruction and applications to Algebraic Coding Theory
Zappatore, I. (2020) · doi:10.70675/8396d168zc20dz447fz80b8z6d464b433b70 · Cited by 1
On the Algorithms of Guruswami-Sudan List Decoding over Finite Rings
Quintin, G. (2012) · Cited by 1
Petreschi, R. (2013) · Springer eBooks · doi:10.1007/978-3-642-39652-6_2
Estimation and Compression over Large Alphabets.
Acharya, J. (2014) · eScholarship (California Digital Library)
Høholdt, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87448-5_9
Reiss, K. M., & Stroth, G. (2010) · Springer eBooks · doi:10.1007/978-3-642-17182-6_4
Nachrichtenübertragung bei gestörten Kanälen
Schulz, R.-H. (1991) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-91939-7_9
Performance Analysis of Error-Correcting Binary Decision Diagrams
Astola, H., Stanković, S., & Astola, J. T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27579-1_41
On squares, cubes, ... in Z[[x]]*Preprint
Heninger, N., Rains, E. M., & Sloane, N. J. A. (2005) · arXiv (Cornell University)
Combinatorial and algebraic coding techniques for flash memory storage
Haymaker, K. (2014) · Lincoln (University of Nebraska)
Sub-Layer-Hopping: Optimierte Staukontrolle für IP-Multicast
Dresler, S., Hofmann, M., & Müller, F. (1999) · Informatik aktuell · doi:10.1007/978-3-642-60111-8_21
Körpererweiterungen und zyklische Codes
Schulz, R.-H. (1991) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-91939-7_15
Error-controlling scheme with encoding and spreading in multi-hop relay network
Eriko, S., & Kohno, R. (2012) · International Symposium on Information Theory and its Applications
On perfect 1-$mathcal E$-error-correcting codes
Heden, O., & Güzeltepe, M. (2015) · Hrčak Portal of scientific journals of Croatia (University Computing Centre)
Storing and Transmission of Digital Audio Signals
Stanković, S., Orović, I., & Sejdić, E. (2015) · Springer eBooks · doi:10.1007/978-3-319-23950-7_3
Classification of perfect codes and minimal distances in the Lee metric
Ahmed, N., & Ahmed, W. (2010) · KTH Publication Database DiVA (KTH Royal Institute of Technology)
An Optimized Implementation of a Succinct Non-Interactive Zero-Knowledge Argument System
Hendri, H. (2013) · BIBSYS Brage (BIBSYS (Norway))
Codes for storage of data on a 1-d granular magnetic medium
Mazumdar, A., Barg, A., & Kashyap, N. (2010) · International Conference on Signal Processing and Communications (SPCOM) · doi:10.1109/spcom.2010.5560471
A note onm-weights of linear codes
Yuan, Y., & Yun, F. (2005) · Wuhan University Journal of Natural Sciences · doi:10.1007/bf02831129
Study on the Development of Synthesis Evaluation System Based on an Improved Fuzzy-AHP Algorithm
Huang, W. (2010) · International Conference on Electrical and Control Engineering · doi:10.1109/icece.2010.529
Modifications to the Lagrange Interpolation Method of Decoding Reed Solomon Codes
Gabrys, R., & Wolf, J. K. (2008) · International Symposium on Communications and Information Technologies · doi:10.1109/iscit.2008.4700234
An Incremental Error Correcting Evaluation Algorithm For Recursion Networks without Circuits
Althöfer, I. (1990) · Lecture notes in biomathematics · doi:10.1007/978-3-662-10619-8_9
Matsui, H. (2009) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e92.a.2146
Smoothness versus skewness in block designs with an application to tournaments
Robinson, D. G. (1995) · Journal of Combinatorial Designs · doi:10.1002/jcd.3180030407
On 2-D non-adjacent-error channel models
Shivkumar, K. M., & Kashyap, N. (2013) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2013.6691319
Hybrid noncoherent network coding
Skachek, V., Milenković, O., & Nedić, A. (2012) · International Symposium on Network Coding (NetCod) · doi:10.1109/netcod.2012.6261876
Generalized upper bounds on the minimum distance of PSK block codes
Laksman, E., Lennerstad, H., & Nilsson, M. (2014) · IMA Journal of Mathematical Control and Information · doi:10.1093/imamci/dnt047
Subcodes constructed from bases of Reed‐Solomon codes
Fuwa, S., Tanabe, H., & Umeda, H. (2003) · Electronics and Communications in Japan (Part I Communications) · doi:10.1002/ecja.1170
Weitere Strukturierung von Wörtern
Schulz, R.-H. (2003) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-80328-3_13
A lifting decoding scheme and its application to interleaved linear codes
Quintin, G. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284707
A Connection Between Coding Theory and Polarized Partition Relations
Carmelo, E. L. M. (2001) · European Journal of Combinatorics · doi:10.1006/eujc.2000.0474
Constructing Nicole : gender, discourse and victimization/criminalization in R v. Ryan
Dooley, D. M. (2013) · Saint Mary's University Institutional Repository (Saint Mary's University)
Definition und Eigenschaften zyklischer Codes
Schulz, R.-H. (1991) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-91939-7_14
Optimal codes as Tanner codes with cyclic component codes
Høholdt, T., Piñero, F., & Zeng, P. (2014) · Designs Codes and Cryptography · doi:10.1007/s10623-014-9962-4
Revisiting the Karnin, Greene and Hellman Bounds
Desmedt, Y., King, B., & Schoenmakers, B. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85093-9_18
Improving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime
Hayajneh, K. F. (2013) · QSpace (Queen's University Library)
Códigos lineares sobre corpos finitos através da métrica de Lee
de Andrade, A. A., & de Araujo, R. R. (2015) · Proceeding Series of the Brazilian Society of Computational and Applied Mathematics · doi:10.5540/03.2015.003.01.0462
Prescribed automorphism groups and two problems in Galois geometries
Wallis, J. L. (2006) · Summit (Simon Fraser University)
Asymmetric Encryption for Wiretap Channels
Al-Hassan, S. (2015) · PEARL (University of Plymouth) · doi:10.24382/1614
On applications of algebraic function fields to codes
Özdemir, M. (2004) · Sabanci University
Manju, C. (2009) · Shodhganga
Théorie de l'Information, codage correcteur d'erreurs
Zémor, G. (2008)
Accelerating Soft-Decision Reed-Muller Decoding Using a Graphics Processing Unit
Uddin, M. S., Kim, C. H., & Kim, J.-M. (2014) · Asia-pacific Journal of Multimedia services convergent with Art Humanities and Sociology · doi:10.14257/ajmahs.2014.12.10
Utilizing Probabilistic Linear Equations in Cube Attacks
Yao, Y., Zhang, B., & Wu, W. (2016) · Journal of Computer Science and Technology · doi:10.1007/s11390-016-1629-3
Risse, T. (2015) · doi:10.15849/icit.2015.0047
Kaur, H., & Luhach, S. (2014) · International Journal of Engineering Trends and Technology · doi:10.14445/22315381/ijett-v11p269
A Survey of Algorithms to Efficiently Reconcile Sets of Infomation
Gabrys, R., & Bilinski, M. (2015) · doi:10.21236/ada624896
Crime investigation: an introduction to error-correcting codes
Myerson, G. (2008)
Electrical Engineering (Communication Theory and Systems)
Acharya, J. (2014)
Solution to Selected Exercises
Chapman, W. A. (1998) · doi:10.1007/978-1-349-14795-3_12
Correlation Immunity of Boolean Functions
Wu, C.-K., & Feng, D. (2016) · Advances in computer science and technology · doi:10.1007/978-3-662-48865-2_4
McCune, E. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511674648.012
On Quaternary Linear Reed-Muller Codes
Vallès, J. P. (2012) · TDX (Tesis Doctorals en Xarxa)
(2010) · Taylor & Francis eBooks · doi:10.4324/9780203450710_chapter_10
Efficient storage codes for non-volatile memories
Chua, M. W. J. (2016) · doi:10.32657/10356/68782
Improving the Performance of Nested Lattice Codes Using ConcatenationPreprint
Vatedka, S., & Kashyap, N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.08236
Prashantha Kumar, H., Sripati, U., & Rajesh Shetty, K. (2011) · ICTACT Journal on Communication Technology · doi:10.21917/ijct.2011.0056
Sidon Sets of Fixed Cardinality and Lattice-Packings of Simplices.Preprint
Kovačević, M., & Tan, V. Y. F. (2016) · arXiv (Cornell University)
Soliton-Like LT Codes over GF(4) and GF(8)
Spencer, J. (2016) · QSpace (Queen's University Library)
Recursive enhancement of intrinsic soft information for complex reed-solomon codes
Mohamed, M. H., Zörlein, H., & Bossert, M. (2016) · International Workshop on Compressed Sensing Theory and its Applications to Radar, Sonar and Remote Sensing · doi:10.1109/cosera.2016.7745687
Syndrome decoding for Hermite codes with a Groebner-basis algorithm
Bouw, I. I., & Kampf, S. (2011)
Random 5eld models for 5tness landscapes
Stadler, P. F., & Happel, R. (1999)
Multi-Erasure Locally Recoverable Codes Over Small Fields For Flash Memory ArrayPreprint
Huang, P., Yaakobi, E., & Siegel, P. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.06110
Zhou, B. (2000) · OhioLink ETD Center (Ohio Library and Information Network)
Code-Based Zero-Knowledge Protocols and Their Applications
Morozov, K. (2017) · Mathematics for industry · doi:10.1007/978-981-10-5065-7_3
List-Decoding of Binary Goppa Codes up to the Binary
Augot, D., Barbier, M., Couvreur, A., et al. (2011)
Enumeration of cyclic codes over ()
Lao, H., Kivunge, B. M., Muthoka, G., et al. (2015)
Symbol Erasure Correction Capability of Spread CodesPreprint
Gluesing-Luerssen, H., & Trautmann, A.-L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.06323
Dictionary learning for hash representation
Zhang, J., Zheng, Z., Chen, Z., et al. (2017) · International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) · doi:10.1109/cisp-bmei.2017.8301968
Using rank two vector bundles for fast decoding of Goppa codes
Brown, A. (2007)
Constructions of Augmented Orthogonal ArraysPreprint
Wang, X., Ji, L., Li, Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.05137
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