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.
Integrity signals
Registry
Cites
Statistics
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?
The Reed-Solomon code can correct up to e erasures and s substitutions with 2s + e additional symbols.
“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]
Cited by
Sorted by citations
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,053 · see citing works
Coding for Errors and Erasures in Random Network Coding
Koetter, R., & Kschischang, F. R. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926449 · Cited by 1,096 · see citing works
“We expect to be able to recover V from U provided that ρ + t D/ 2 = ℓ − k + 1, and we will describe a Sudan-style “list-1” minimum distance decoding algorithm to do so (see, e.g., [27, Sec.”
MethodChannel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 404 · see citing works
HMOG: New Behavioral Biometric Features for Continuous Authentication of Smartphone Users
Sitová, Z., Šeděnka, J., Yang, Q., Ge, P., Zhou, G., Gasti, P., & Balagani, K. S. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2506542 · Cited by 408 · see citing works
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix MultiplicationPreprint
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10464 · Cited by 439 · see citing works
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 270 · see citing works
Decoding error-correcting codes via linear programming
Feldman, J., & Karger, D. R. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 236 · see citing works
Emerging Approaches to DNA Data Storage: Challenges and Prospects
Doricchi, A., Platnich, C. M., Gimpel, A., Horn, F., Earle, M., Lanzavecchia, G., Cortajarena, A. L., Liz-Marzán, L. M., Liu, N., Heckel, R., et al. (2022) · ACS Nano · doi:10.1021/acsnano.2c06748 · Cited by 235 · see citing works
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
Banawan, K., & Ulukuş, Ş. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2869154 · Cited by 198 · see citing works
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
May, A., Meurer, A., & Thomae, E. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25385-0_6 · Cited by 215 · see citing works
Lagrange Coded Computing: Optimal Design for Resiliency, Security and PrivacyPreprint
Yu, Q., Li, S., Raviv, N., Kalan, S. M. M., Soltanolkotabi, M., & Avestimehr, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.00939 · Cited by 325 · see citing works
A survey of partial difference sets
Ma, S. L. (1994) · Designs Codes and Cryptography · doi:10.1007/bf01388454 · Cited by 199 · see citing works
A Foundation in Digital Communication
Lapidoth, A. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316822708 · Cited by 187 · see citing works
Bounds on the Size of Locally Recoverable Codes
Cadambe, V. R., & Mazumdar, A. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2477406 · Cited by 184 · see citing works
HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints
Press, W. H., Hawkins, J. A., Jones, S. K., Schaub, J. M., & Finkelstein, I. J. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2004821117 · Cited by 178 · see citing works
$${{{\mathbb Z}_2}{{\mathbb Z}_4}}$$ -linear codes: generator matrices and duality
Borges, J., Fernández-Córdoba, C., Pujol, J., et al. (2009) · Designs Codes and Cryptography · doi:10.1007/s10623-009-9316-9 · Cited by 180 · see citing works
Davis, J. A., & Jedwab, J. (1997) · Electronics Letters · doi:10.1049/el:19970205 · Cited by 179 · see citing works
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Chen, H., & Cramer, R. (2006) · Lecture notes in computer science · doi:10.1007/11818175_31 · Cited by 168 · see citing works
Graduate Theses and Dissertations
Davis, M., Davis, K. J., & Dunagan, M. M. (2012) · Elsevier eBooks · doi:10.1016/b978-0-12-384727-0.00006-9 · Cited by 165 · see citing works
Sawaya, N. P. D., Menke, T., Kyaw, T. H., Johri, S., Aspuru-Guzik, A., & Guerreschi, G. G. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0278-0 · Cited by 163 · see citing works
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously
Li, S., Yu, M., Yang, C.-S., Avestimehr, A. S., Kannan, S., & Viswanath, P. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174305 · Cited by 160 · see citing works
A tale of two erasure codes in HDFS
Xia, M., Saxena, M. C., Blaum, M., et al. (2015) · doi:10.5555/2750482.2750499 · Cited by 146 · see citing works
Towards a theory of landscapes
Stadler, P. F., & Santa Fe Institute (2008) · Springer eBooks · doi:10.1007/bfb0103571 · Cited by 139 · see citing works
Coding Over Sets for DNA Storage
Lenz, A., Siegel, P. H., Wachter-Zeh, A., & Yaakobi, E. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437544 · Cited by 133 · see citing works
Plank, J. S. (2008) · Cited by 133 · see citing works
Coding for Errors and Erasures in Random Network Coding
Koetter, R., & Kschischang, F. R. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557321 · Cited by 133 · see citing works
Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes
Tang, L., & Ramamoorthy, A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2800059 · Cited by 132 · see citing works
Basic Phylogenetic Combinatorics
Dress, A., Huber, K. T., Koolen, J. H., Moulton, V., & Spillner, A. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139019767 · Cited by 119 · see citing works
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares
Zhang, L. G., Huang, Q., Lin, S., et al. (2010) · IEEE Transactions on Communications · doi:10.1109/tcomm.2010.091710.090721 · Cited by 122 · see citing works
Soft Maximum Likelihood Decoding using GRAND
Solomon, A., Duffy, K. R., & Médard, M. (2020) · International Conference on Communications · doi:10.1109/icc40277.2020.9149208 · Cited by 117 · see citing works
Exploitation of Stragglers in Coded Computation
Kiani, S., Ferdinand, N. S., & Draper, S. C. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437871 · Cited by 114 · see citing works
Data Storage Management in Cloud Environments
Mansouri, Y., Toosi, A. N., & Buyya, R. (2017) · ACM Computing Surveys · doi:10.1145/3136623 · Cited by 111 · see citing works
Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
Huang, Q., Diao, Q., Lin, S., et al. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2179842 · Cited by 110 · see citing works
“It is well known in coding theory [23]–[27] that”
BackgroundParallelized Progressive Network Coding With Hardware Acceleration
Shojania, H., & Li, B. (2007) · International Workshop on Quality of Service · doi:10.1109/iwqos.2007.376547 · Cited by 105 · see citing works
“To code a new coded block xj in network coding, a network node first independently and randomly chooses a set of coding coefficients [cj1,cj2,···,cjn] in GF(28) Galois field [ 14 ], one for each received block (or each original block on the data source).”
BackgroundMethodInfluentialGradient Coding From Cyclic MDS Codes and Expander Graphs
Raviv, N., Tamo, I., Tandon, R., & Dimakis, A. G. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3029396 · Cited by 158 · see citing works
Linear codes using skew polynomials with automorphisms and derivations
Boucher, D., & Ulmer, F. (2012) · Designs Codes and Cryptography · doi:10.1007/s10623-012-9704-4 · Cited by 99 · see citing works
Design of Network Codes for Multiple-User Multiple-Relay Wireless Networks
Xiao, M. B., Kliewer, J., & Skoglund, M. (2012) · IEEE Transactions on Communications · doi:10.1109/tcomm.2012.091012.110121 · Cited by 97 · see citing works
Entanglement Sampling and Applications
Dupuis, F., Fawzi, O., & Wehner, S. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2371464 · Cited by 95 · see citing works
Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read Channels
Yaakobi, E., Bruck, J., & Siegel, P. H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2522434 · Cited by 93 · see citing works
Practical Digital Wireless Signals
McCune, E. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511674648 · Cited by 92 · see citing works
Improving Embedding Efficiency of Covering Codes for Applications in Steganography
Zhang, W., Wang, S., & Zhang, X. (2007) · IEEE Communications Letters · doi:10.1109/lcomm.2007.070438 · Cited by 91 · see citing works
Binary Linear Locally Repairable Codes
Huang, P., Yaakobi, E., Uchikawa, H., et al. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2605119 · Cited by 85 · see citing works
“44 in [25]), H ′′ 3 = [1, 1, · · · , 1], and H ′′ 4 = [1, 1, · · · , 1].”
An Upper Bound On the Size of Locally Recoverable Codes
Cadambe, V., & Mazumdar, A. (2013) · Cited by 84 · see citing works
Constructions of new orthogonal arrays and covering arrays of strength three
Ji, L., & Yin, J. (2009) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2009.06.002 · Cited by 84 · see citing works
A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes
Diao, Q., Huang, Q. L., Lin, S., et al. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2184834 · Cited by 83 · see citing works
“Both and are Vandermonde matrices and nonsingular [2], [45].”
BackgroundDecoding the (24,12,8) Golay code
Reed, I. S., Yin, X., Truong, T. K., et al. (1990) · IEE Proceedings E Computers and Digital Techniques · doi:10.1049/ip-e.1990.0025 · Cited by 82 · see citing works
On Optimal k-Deletion Correcting Codes
Sima, J., & Bruck, J. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3028702 · Cited by 81 · see citing works
An upper bound on the size of locally recoverable codes
Cadambe, V. R., & Mazumdar, A. (2013) · International Symposium on Network Coding (NetCod) · doi:10.1109/netcod.2013.6570829 · Cited by 80 · see citing works
SecureFace: Face Template Protection
Mai, G., Cao, K., Lan, X., & Yuen, P. C. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.3009590 · Cited by 80 · see citing works
Ruprecht, J. J., & Nield, J. (2001) · Progress in Biophysics and Molecular Biology · doi:10.1016/s0079-6107(01)00004-9 · Cited by 78 · see citing works
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
Wiechman, G., & Sason, I. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920216 · Cited by 77 · see citing works
Random field models for fitness landscapes
Stadler, P. F., & Happel, R. (1999) · Journal of Mathematical Biology · doi:10.1007/s002850050156 · Cited by 76 · see citing works
On the Security of Index Coding With Side Information
Dau, S. H., Skachek, V., & Chee, Y. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2188777 · Cited by 75 · see citing works
Magnússon, S., Shokri‐Ghadikolaei, H., & Li, N. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3031073 · Cited by 71 · see citing works
Korshunov, A. D. (2003) · Russian Mathematical Surveys · doi:10.1070/rm2003v058n05abeh000667 · Cited by 74 · see citing works
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
Gabrys, R., Yaakobi, E., & Milenković, O. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2778143 · Cited by 73 · see citing works
“The following bound follows by noting the existence of binary codes of length n and minimum distance 4 + 1 which have 2 log n bits of redundancy (see [17], Problem 8.”
BackgroundPatel, M., Kim, J. S., Hassan, H., et al. (2019) · IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00017 · Cited by 68 · see citing works
Linear nonbinary covering codes and saturating sets in projective spaces
Davydov, A. A., Giulietti, M., Marcugini, S., et al. (2011) · Advances in Mathematics of Communications · doi:10.3934/amc.2011.5.119 · Cited by 67 · see citing works
Lee discrepancy and its applications in experimental designs
Zhou, Y., Ning, J., & Song, X.-B. (2008) · Statistics & Probability Letters · doi:10.1016/j.spl.2008.01.062 · Cited by 66 · see citing works
Yaakobi, E., Kayser, S., Siegel, P. H., et al. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2200291 · Cited by 65 · see citing works
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262778 · Cited by 65 · see citing works
Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing
Sason, I., & Verdú, S. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2757496 · Cited by 65 · see citing works
On the distance distribution of codes
Kalai, G., & Linial, N. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.412711 · Cited by 61 · see citing works
On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information
Heidarzadeh, A., Garcia, B., Kadhe, S., et al. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8635969 · Cited by 60 · see citing works
Construction of Sidon Spaces With Applications to Coding
Roth, R. M., Raviv, N., & Tamo, I. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2766178 · Cited by 60 · see citing works
Self-citationAnytime coding for distributed computation
Ferdinand, N. S., & Draper, S. C. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852337 · Cited by 54 · see citing works
Probabilistic Mitigation of Control Channel Jamming via Random Key Distribution
Tague, P., Li, M., & Poovendran, R. (2007) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc.2007.4394778 · Cited by 58 · see citing works
Completely regular codes and completely transitive codes
Solé, P. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90152-8 · Cited by 58 · see citing works
$${\mathbb{Z}_2\mathbb{Z}_4}$$ -linear codes: rank and kernel
Fernández-Córdoba, C., Pujol, J., & Villanueva, M. (2009) · Designs Codes and Cryptography · doi:10.1007/s10623-009-9340-9 · Cited by 57 · see citing works
Seakeeping optimization of trimaran outrigger layout based on NSGA-II
Wang, S. M., Ma, S., & Duan, W. (2018) · Applied Ocean Research · doi:10.1016/j.apor.2018.06.010 · Cited by 56 · see citing works
Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform
Huang, Q., Tang, L., He, S., et al. (2014) · IEEE Transactions on Communications · doi:10.1109/tcomm.2014.2316174 · Cited by 56 · see citing works
Patel, M., Kim, J. S., Shahroodi, T., Hassan, H., & Mutlu, O. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00034 · Cited by 58 · see citing works
Optimal Linear and Cyclic Locally Repairable Codes over Small Fields
Zeh, A., & Yaakobi, E. (2015) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 55 · see citing works
Beelen, P., Puchinger, S., & Rosenkilde, J. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006545 · Cited by 52 · see citing works
Beelen, P., Puchinger, S., & Rosenkilde, J. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3146254 · Cited by 52 · see citing works
Lower bounds for depth 4 formulas computing iterated matrix multiplication
Fournier, H., Limaye, N., Malod, G., et al. (2014) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2591796.2591824 · Cited by 52 · see citing works
Design of network codes for multiple-user multiple-relay wireless networks
Xiao, M. B., & Skoglund, M. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5206007 · Cited by 51 · see citing works
A combination of testability and decodability by tensor products
Viderman, M. (2013) · Random Structures and Algorithms · doi:10.1002/rsa.20498 · Cited by 50 · see citing works
Construction of MDS twisted Reed–Solomon codes and LCD MDS codes
Liu, H., & Liu, S. (2021) · Designs Codes and Cryptography · doi:10.1007/s10623-021-00899-z · Cited by 50 · see citing works
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Couvreur, A., Otmani, A., & Tillich, J. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2574841 · Cited by 50 · see citing works
Secure Compute-and-Forward in a Bidirectional Relay
Vatedka, S., Kashyap, N., & Thangaraj, A. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2412114 · Cited by 50 · see citing works
Locally Recoverable Codes from Algebraic Curves and Surfaces
Barg, A., Haymaker, K., Howe, E. W., et al. (2017) · Association for Women in Mathematics series · doi:10.1007/978-3-319-63931-4_4 · Cited by 49 · see citing works
Asymmetric Lee Distance Codes for DNA-Based Storage
Gabrys, R., Kiah, H. M., & Milenković, O. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2700847 · Cited by 49 · see citing works
Li, S., & Avestimehr, S. (2020) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000103 · Cited by 56 · see citing works
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures
Krishnan, M. N., & Kumar, P. V. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437570 · Cited by 48 · see citing works
“^ 8 + ^2 9; 7 + ^2 8 + ^4 9gare both independent. These evaluation points along with f 0; 1;:::; 5; 10gform an independent set of cardinality, k= 9. = 4: The erased coordinates are in [7;13]. After removing the interference from the known code-symbols fc 4g, c^ 14 = c 7 + ^2c 8 + ^4c 9 = f( 7 + ^2 8 + ^4 9). 7 + ^2 8…”
Optimal linear and cyclic locally repairable codes over small fields
Zeh, A., & Yaakobi, E. (2015) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2015.7133123 · Cited by 47 · see citing works
Graded Bit-Error-Correcting Codes With Applications to Flash Memory
Gabrys, R., Yaakobi, E., & Dolecek, L. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2234207 · Cited by 47 · see citing works
Baston, V. J., & Bostock, F. A. (1991) · Naval Research Logistics (NRL) · doi:10.1002/1520-6750(199104)38:2 · Cited by 47 · see citing works
Constructions of Partial MDS Codes Over Small Fields
Gabrys, R., Yaakobi, E., Blaum, M., et al. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2890201 · Cited by 46 · see citing works
1 1 Product Constructions for Perfect Lee CodesPreprint
Etzion, T. (2016) · Cited by 46 · see citing works
Fuzzy Password-Authenticated Key Exchange
Dupont, P.-A., Hesse, J., Pointcheval, D., et al. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_13 · Cited by 45 · see citing works
Pless, V. S. (1986) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(86)90066-x · Cited by 45 · see citing works
Wireless video content delivery through coded distributed caching
Golrezaei, N., Shanmugam, K., Dimakis, A. G., et al. (2012) · International Conference on Communications · doi:10.1109/icc.2012.6364526 · Cited by 44 · see citing works
The Role of Coded Side Information in Single-Server Private Information Retrieval
Heidarzadeh, A., Kazemi, F., & Sprintson, A. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3029314 · Cited by 44 · see citing works
A coding-theoretic approach for efficient message verification over insecure channels
Slater, D., Tague, P., Poovendran, R., et al. (2009) · doi:10.1145/1514274.1514297 · Cited by 43 · see citing works
Partial Spreads and Vector Space Partitions
Honold, T., Kiermaier, M., & Kurz, S. (2018) · Signals and communication technology · doi:10.1007/978-3-319-70293-3_7 · Cited by 43 · see citing works
Generalized Alon--Boppana Theorems and Error-Correcting Codes
Friedman, J., & Tillich, J. (2005) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480102408353 · Cited by 43 · see citing works
Cohen, G., Litsyn, S. N., Vardy, A., et al. (1996) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480195280137 · Cited by 43 · see citing works
LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing
Diao, Q., Tai, Y. Y., Lin, S., et al. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2280640 · Cited by 42 · see citing works
Nearly Optimal Constructions of PIR and Batch Codes
Asi, H., & Yaakobi, E. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006508 · Cited by 42 · see citing works
- 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 › Computer Science › Artificial Intelligence › 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
