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 101–200 of 923
Kayser, S., Yaakobi, E., Siegel, P. H., et al. (2010) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2010.5707027 · Cited by 40
Improved Constructions for Non-adaptive Threshold Group Testing
Cheraghchi, M. (2013) · Algorithmica · doi:10.1007/s00453-013-9754-7 · Cited by 40
Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval
Banawan, K., & Ulukuş, Ş. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2935440 · Cited by 40
Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems
Shum, K. W., & Hu, Y. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033778 · Cited by 40
A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences
Palunčić, F., Abdel-Ghaffar, K., Ferreira, H. C., et al. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2172725 · Cited by 39
“It should be stated that the previous algorithm is similar, but not identical, to the one developed in [18] to decode Lee-metric alternant and GRS codes.”
ResultYaakobi, E., Kayser, S., Siegel, P. H., et al. (2010) · IEEE Information Theory Workshop (ITW) · doi:10.1109/cig.2010.5592956 · Cited by 39
List Decoding of Insertions and Deletions
Wachter-Zeh, A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2777471 · Cited by 39
Anchor-Based Correction of Substitutions in Indexed Sets
Lenz, A., Siegel, P. H., Wachter-Zeh, A., & Yaakobi, E. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849523 · Cited by 36
Information Theory and Coding by Example
Kelbert, M., & Suhov, Y. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139028448 · Cited by 35
Batch and PIR Codes and Their Connections to Locally Repairable Codes
Skachek, V. (2018) · Signals and communication technology · doi:10.1007/978-3-319-70293-3_16 · Cited by 39
Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes
Mazumdar, A., Chandar, V., & Wornell, G. W. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.140517 · Cited by 38
An Optimal Data Hiding Scheme With Tree-Based Parity Check
Hou, C.-L., Lu, C.-C., Tsai, S., et al. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2072513 · Cited by 37
Elishco, O., Meyerovitch, T., & Schwartz, M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2531722 · Cited by 36
The Highly Connected Matroids in Minor-Closed Classes
Geelen, J., Gerards, B., & Whittle, G. (2015) · Annals of Combinatorics · doi:10.1007/s00026-015-0251-3 · Cited by 36
Nonadaptive Group Testing With Random Set of Defectives
Mazumdar, A. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2613870 · Cited by 36
Bounds and Constructions of Codes Over Symbol-Pair Read Channels
Elishco, O., Gabrys, R., & Yaakobi, E. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2942283 · Cited by 36
On Coding Over Sliced Information
Sima, J., Raviv, N., & Bruck, J. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3063709 · Cited by 44
Decoding of block and convolutional codes in rank metric
Wachter-Zeh, A. (2013) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.18725/oparu-2515 · Cited by 36
Functional-repair-by-transfer regenerating codes
Shum, K. W., & Hu, Y. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6283043 · Cited by 35
Secret Key and Private Key Constructions for Simple Multiterminal Source Models
Ye, C., & Narayan, P. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173731 · Cited by 35
Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information
Heidarzadeh, A., Kazemi, F., & Sprintson, A. (2018) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2018.8613304 · Cited by 35
The Need for Flow Fingerprints to Link Correlated Network Flows
Houmansadr, A., & Borisov, N. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39077-7_11 · Cited by 38
Choi, J. J., Love, D. J., & Bidigare, T. P. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2389766 · Cited by 34
Chowdhury, M. F. I., Jeannerod, C.-P., Neiger, V., Schost, É., & Villard, G. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2416068 · Cited by 32
Fault- Tolerant Dot-Product Engines
Roth, R. M. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437919 · Cited by 34
“For the special case of the Hamming metric, Proposition 1 can be generalized to handle erasures as well (see [13, p. 16, Prop.”
BackgroundMethodInfluentialSelf-citationRoth, R. M. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2977918 · Cited by 34
Self-citationFooling Parity Tests with Parity Gates
Gutfreund, D., & Viola, E. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27821-4_34 · Cited by 33
Survey for a Decade of Coding for DNA Storage
Sabary, O., Kiah, H. M., Siegel, P. H., & Yaakobi, E. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3403488 · Cited by 35
Unique Reconstruction of Coded Strings From Multiset Substring Spectra
Gabrys, R., & Milenković, O. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2935973 · Cited by 31
5G NR CA-Polar Maximum Likelihood Decoding by GRAND
Duffy, K. R., Solomon, A., Konwar, K. M., et al. (2020) · Conference on Information Sciences and Systems · doi:10.1109/ciss48834.2020.1570617412 · Cited by 30
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels
Hof, E., Sason, I., & Shamai, S. S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2011443 · Cited by 30
Bruyère, V., & Latteux, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61440-0_115 · Cited by 30
MDS and near-MDS codes via twisted Reed–Solomon codes
Sui, J., Zhu, X., & Shi, X. (2022) · Designs Codes and Cryptography · doi:10.1007/s10623-022-01049-9 · Cited by 29
Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation
Fashandi, S., Gharan, S. O., & Khandani, A. K. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2043368 · Cited by 29
Hamming codes as error-reducing codes
Rurik, W., & Mazumdar, A. (2016) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2016.7606865 · Cited by 29
Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
Ma, Z., & Wu, Y. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2487541 · Cited by 29
Anticode-based locally repairable codes with high availability
Silberstein, N., & Zeh, A. (2017) · Designs Codes and Cryptography · doi:10.1007/s10623-017-0358-0 · Cited by 29
“CI, Theorem 4 [28, 5, 14] 2 12 5 3 [25, 5, 12] 2 9 5 4 [21, 5, 10] 2 5 5 5 [60, 6, 30] 2 28 6 3 [57, 6, 28] 2 25 6 4 [53, 6, 26] 2 21 6 5 CII, Theorem 5 [21, 5, 10] 2 5 5 4 CIII, Theorem 6 [31, 6, 15] 3 9 6 − [63, 7, 31] 3 20 7 − CIV, Theorem 7 [24, 5, 12] 2 8 5 3 [48, 6, 24] 2 16 6 4 [56, 6, 28] 2 24 6 3”
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
Ford, J., & Gál, A. (2005) · Lecture notes in computer science · doi:10.1007/11523468_94 · Cited by 29
Cooperative repair of multiple node failures in distributed storage systems
Shum, K. W., & Chen, J. (2016) · International Journal of Information and Coding Theory · doi:10.1504/ijicot.2016.079495 · Cited by 28
On finite alphabet compressive sensing
Das, A. K., & Vishwanath, S. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638794 · Cited by 28
A design and a code invariant under the simple group Co3
Haemers, W. H., Parker, C. W., Pless, V. S., et al. (1993) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(93)90045-a · Cited by 28
Curves over Finite Fields and Codes
van der Geer, G. (2001) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8266-8_18 · Cited by 28
Reconstruction Codes for DNA Sequences With Uniform Tandem-Duplication Errors
Yehezkeally, Y., & Schwartz, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2940256 · Cited by 31
“…small portion of y Then, for any real 0 q n − k q ( n − k )( H q (ξ) − 1 ) , where H q ( · ) is the q -ary entropy function, H q (ξ) (cid:2) − ξ log q ξ − ( 1 − ξ) log q ( 1 − ξ) + ξ log q ( q − 1 ), and where we used a standard bounding of the size on the Hamming ball, e.g., see [39, Lemma 4.7].”
InfluentialQuantum simulation of nuclear Hamiltonian with a generalized transformation for Gray code encoding
Siwach, P., & Arumugam, P. (2021) · Physical Review C · doi:10.1103/physrevc.104.034301 · Cited by 30
Quasi-symmetric Designs and Self-dual Codes
Tonchev, V. D. (1986) · European Journal of Combinatorics · doi:10.1016/s0195-6698(86)80018-x · Cited by 27
Buchnik, Y., & Friedman, R. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3397230.3397246 · Cited by 26
1 Coding for High-Density Recording on a 1-D Granular Magnetic Medium
Mazumdar, A., Barg, A., & Kashyap, N. (2011) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · Cited by 26
List-decoding of binary Goppa codes up to the binary Johnson bound
Augot, D., Barbier, M., & Couvreur, A. (2011) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2011.6089384 · Cited by 26
Fault Tolerance in Distributed Systems Using Fused Data Structures
Balasubramanian, B., & Garg, V. K. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.96 · Cited by 26
Asymptotically Good Additive Cyclic Codes Exist
Shi, M., Wu, R., & Solé, P. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2863370 · Cited by 26
Shinkar, T., Yaakobi, E., Lenz, A., & Wachter-Zeh, A. (2019) · IEEE Transactions on Information Theory · doi:10.1109/isit.2019.8849737 · Cited by 23
On the lengths of divisible codes
Kiermaier, M., & Kurz, S. (2019) · EPub Bayreuth (University of Bayreuth) · Cited by 26
Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
Keevash, P., & Sudakov, B. (2005) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480103434634 · Cited by 26
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
Mazumdar, A., Barg, A., & Kashyap, N. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158514 · Cited by 25
General Linearized Polynomial Interpolation and Its Applications
Xie, H., Yan, Z., & Suter, B. W. (2011) · doi:10.1109/isnetcod.2011.5978942 · Cited by 25
“While both Gabidulin and KK codes are important to error control in random linear network coding (see, for example, [7]–[9]), Gabidulin codes are also considered for potential applications in wireless communications [10], public-key cryptosystems [11], and storage systems [1], [12].”
BackgroundMethodInfluentialHuman-Inspired Haptic Perception and Control in Robot-Assisted Milling Surgery
Dai, Y., Xue, Y., & Zhang, J. (2020) · IEEE Transactions on Haptics · doi:10.1109/toh.2020.3029043 · Cited by 26
Codes in the damerau distance for DNA storage
Gabrys, R., Yaakobi, E., & Milenković, O. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541778 · Cited by 25
On the automorphism group of various Goppa codes
Wesemeyer⋆, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661509 · Cited by 25
Constructions of partial MDS codes over small fields
Gabrys, R., Yaakobi, E., Blaum, M., et al. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006478 · Cited by 24
Serdyukova, N. A., Serdyukov, V. I., & Neustroev, S. (2019) · Smart innovation, systems and technologies · doi:10.1007/978-981-13-8260-4_46 · Cited by 24
Synchronization overZ2and community detection in signed multiplex networks with constraints
Cucuringu, M. (2015) · Journal of Complex Networks · doi:10.1093/comnet/cnu050 · Cited by 26
Succinct Representation of Codes with Applications to Testing
Grigorescu, E., Kaufman, T., & Sudan, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03685-9_40 · Cited by 23
A coded shared atomic memory algorithm for message passing architectures
Cadambe, V. R., Lynch, N. A., Médard, M., et al. (2016) · Distributed Computing · doi:10.1007/s00446-016-0275-x · Cited by 23
Survey on cryptanalysis of code-based cryptography: From theoretical to physical attacks
Drăgoi, V., Richmond, T., Bucerzan, D., & Legay, A. (2018) · International Conference on Computers Communications and Control (ICCCC) · doi:10.1109/icccc.2018.8390461 · Cited by 23
“For details we address the reader to wellknown books [10], [11], [12].”
Zhang, S., Tian, C., Zhang, H., et al. (2019) · IEEE Access · doi:10.1109/access.2019.2913591 · Cited by 23
Xagawa, K. (2010) · Cited by 25
Multi-User Linearly-Separable Distributed Computing
Khalesi, A., & Elia, P. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3283967 · Cited by 23
Classification of the $Z_{2}Z_{4}$ -Linear Hadamard Codes and Their Automorphism Groups
Krotov, D. S., & Villanueva, M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2379644 · Cited by 22
Linear codes for high payload steganography
Khatirinejad, M., & Lisoněk, P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.02.004 · Cited by 21
Scaling Blockchains with Error Correction Codes: A Survey on Coded Blockchains
Yang, C., Chin, K., Wang, J., Wang, X., Liu, Y., & Zheng, Z. (2023) · ACM Computing Surveys · doi:10.1145/3637224 · Cited by 32
Constacyclic codes as invariant subspaces
Radkova, D., & van Zanten, A. J. (2008) · Linear Algebra and its Applications · doi:10.1016/j.laa.2008.09.036 · Cited by 21
On irreducible polynomial remainder codes
Yu, J.-H., & Loeliger, H. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033721 · Cited by 21
Heidarzadeh, A., Kazemi, F., & Sprintson, A. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849648 · Cited by 21
On the Pseudocodeword Redundancy of Binary Linear Codes
Zumbrägel, J., Skachek, V., & Flanagan, M. F. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2193661 · Cited by 21
List Decoding of Algebraic Codes
Rosenkilde, J. (2013) · Cited by 20
Fuzzy Asymmetric Password-Authenticated Key Exchange
Erwig, A., Hesse, J., Orlt, M., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_26 · Cited by 20
Distributed MIMO Systems for 6G
Haliloğlu, Ö., Yu, H., Madapatha, C., et al. (2023) · Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit) · doi:10.1109/eucnc/6gsummit58263.2023.10188355 · Cited by 20
Interleaved Product LDPC Codes
Baldi, M., Cancellieri, G., & Chiaraluce, F. (2012) · IEEE Transactions on Communications · doi:10.1109/tcomm.2012.030712.100173 · Cited by 20
Multiple-Access Network Information-Flow and Correction Codes
Dikaliotis, T. K., Ho, T., Jaggi, S., et al. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2095130 · Cited by 20
“− 2z (1) and can be achieved by a classical end-to-end error-correction code over multiple disjoint paths from source to the sink. This result is a direct extension of the Singleton bound (see, e.g., [10]). Since the Singleton bound can be achieved by a maximum distance separable code, as for example a Reed-Solomon co…”
BackgroundOn Coding Over Sliced Information
Sima, J., Raviv, N., & Bruck, J. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849596 · Cited by 24
Lin, S., Abdel-Ghaffar, K., Li, J., et al. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2978383 · Cited by 20
On the hardness of the Lee syndrome decoding problem
Weger, V., Khathuria, K., Trautmann, A.-L., Battaglioni, M., Santini, P. M., & Persichetti, E. (2022) · Advances in Mathematics of Communications · doi:10.3934/amc.2022029 · Cited by 23
HMOG: A New Biometric Modality for Continuous Authentication of Smartphone Users.Preprint
Sitová, Z., Šeděnka, J., Yang, Q., Ge, P., Zhou, G., Gasti, P., & Balagani, K. S. (2015) · arXiv (Cornell University) · Cited by 20
3 1 On Rational-Interpolation Based List-Decoding and List-Decoding Binary Goppa CodesPreprint
Beelen, P., Høholdt, T., Rosenkilde, J., Wu, Y., & Member, S. (2013) · Cited by 18
Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels
Molkaraie, M., & Loeliger, H. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2212413 · Cited by 18
Lenz, A., Bitar, R., Wachter-Zeh, A., et al. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3279768 · Cited by 19
Lipmaa, H., & Skachek, V. (2015) · CIM series in mathematical sciences · doi:10.1007/978-3-319-17296-5_26 · Cited by 19
Designing Uniform Computer Sequential Experiments with Mixture Levels Using Lee Discrepancy
Elsawah, A. M. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-018-7173-1 · Cited by 19
Guessing Attacks on Distributed-Storage Systems
Bracher, A., Hof, E., & Lapidoth, A. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2933000 · Cited by 19
“se in the proof of Theorems 24 and 25. Theorems 24 and 25 are proved in Section F.2. F.1 Properties of MDS Codes The following results on maximum-distance separable (MDS) codes can be found, e.g., in [24]. An (n,k) linear code C over a finite field Fq is a k-dimensional linear subspace of the vector space Fn q of all n-…”
BackgroundSHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits
Bakshi, M., Jaggi, S., Cai, S., et al. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483298 · Cited by 19
Deep Neural Networks Classification via Binary Error-Detecting Output Codes
Klimo, M., Lukáč, P., & Tarábek, P. (2021) · Applied Sciences · doi:10.3390/app11083563 · Cited by 19
ϵ-Approximate Coded Matrix Multiplication Is Nearly Twice as Efficient as Exact Multiplication
Jeong, H., Devulapalli, A., Cadambe, V. R., & Calmon, F. P. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3099811 · Cited by 19
On Single Server Private Information Retrieval With Private Coded Side Information
Lu, Y., & Jafar, S. A. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3253078 · Cited by 18
New constructions of self-dual codes via twisted generalized Reed-Solomon codes
Sui, J., Yue, Q., & Sun, F. (2023) · Cryptography and Communications · doi:10.1007/s12095-023-00644-4 · Cited by 18
Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
Hof, E., Sason, I., Shamai, S. S., et al. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2236971 · Cited by 18
“and (7), except that the input alph abet X is no longer binary. C. MDS codes Some basic properties of MDS codes are provided. For complete details and proofs, the reader is referred, e.g., to [6] or [7]. Definition 3. An (n,k)linear block code C whose minimum distance is d is called a maximum distance separable (MDS) c…”
BackgroundPrivacy preserving protocol for detecting genetic relatives using rare variants
Hormozdiari, F., Joo, J. W. J., Wadia, A., Guan, F., Ostrovsky, R., Sahai, A., & Eskin, E. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu294 · Cited by 18
Improved Constructions for Non-adaptive Threshold Group Testing
Cheraghchi, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14165-2_47 · Cited by 18
Bartoli, D., Faina, G., Marcugini, S., & Pambianco, F. (2012) · Journal of Combinatorial Designs · doi:10.1002/jcd.21321 · Cited by 17
Dolev, S., Petig, T., & Schiller, E. M. (2022) · Algorithmica · doi:10.1007/s00453-022-01023-w · Cited by 18
Mass Error-Correction Codes for Polymer-Based Data Storage
Gabrys, R., Pattabiraman, S., & Milenković, O. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174404 · Cited by 20
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
