Introduction to Coding Theory

MDS coding is better than replication for job completion times

Duffy, K. R., & Shneer, S. (2020) · Operations Research Letters · doi:10.1016/j.orl.2020.11.010 · Cited by 6

All-to-All Gradecast Using Coding with Byzantine Failures

Bridgman, J. F., & Garg, V. K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33536-5_29 · Cited by 2

Multimedia Protection using Content and Embedded Fingerprints

Varna, A. L. (2011) · University Libraries (University of Maryland) · Cited by 2

Bifurcations in iterative decoding and root locus plots

Kellett, C. M., & Weller, S. R. (2008) · IET Control Theory and Applications · doi:10.1049/iet-cta:20080090 · Cited by 2

Communication in the presence of replication

Barkol, O., Ishai, Y., & Weinreb, E. (2008) · doi:10.1145/1374376.1374472 · Cited by 2

Construction of binary minimal product parity-check matrices

Esmaeili, M. (2008) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-008-0069-x · Cited by 2

The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer LinkPreprint

Bras-Amorós, M., & O’Sullivan, M. E. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.2198 · Cited by 2

Network Coding for Error Correction

Vyetrenko, S. (2011) · doi:10.7907/d2zm-v541 · Cited by 2

Portable multitrack audio storage strategy basedon Reed Solomon codes

Sandnes, F. E. (1999) · Electronics Letters · doi:10.1049/el:19990464 · Cited by 2

Entropies of weighted sums and applications to polar codesPreprint

Abbe, E. A., Li, J., & Madiman, M. (2015) · arXiv (Cornell University) · Cited by 2

Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable CodesPreprint

Prakash, N., & Médard, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.01105 · Cited by 2

A formal model of molecular codes with respect to chemical reaction networks

Görlich, D. (2013) · Common Library Network (Der Gemeinsame Bibliotheksverbund) · Cited by 2

Expander Graphs and Coding Theory

Dowling, M. C. (2016) · TigerPrints (Clemson University) · Cited by 2

Guruswami--Sudan List Decoding for Complex Reed--Solomon CodesPreprint

Mohamed, M. H., Puchinger, S., & Bossert, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.07811 · Cited by 2

Hardness of Distributed OptimizationPreprint

Bachrach, N., Censor-Hillel, K., Dory, M., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.10284 · Cited by 2

Power Decoding of Reed-Solomon Codes RevisitedPreprint

Nielsen, J. S. R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.1940 · Cited by 2

Update-Efficiency and Local Repairability Limits for Capacity Approaching CodesPreprint

Mazumdar, A., Chandar, V., & Wornell, G. W. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.3224 · Cited by 2

Power Decoding Reed--Solomon Codes Up to the Johnson RadiusPreprint

Rosenkilde, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.02111 · Cited by 2

A Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier TransformPreprint

Huang, Q., Tang, L., Wang, Z., et al. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3220 · Cited by 2

Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial ApproximationsPreprint

Chowdhury, M. F. I., Jeannerod, C.-P., Neiger, V., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.0643 · Cited by 2

Dense Testers: Almost Linear Time and Locally Explicit ConstructionsPreprint

Bshouty, N. H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.5889 · Cited by 2

Fundamental Limits of Byzantine AgreementPreprint

Chen, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.10965 · Cited by 2

Background on Information Theory and Coding Theory

Joyner, D. A., & Kim, J.-L. (2011) · Applied and numerical harmonic analysis · doi:10.1007/978-0-8176-8256-9_1 · Cited by 1

Codes correcting restricted errors

Shparlinski, I. E., & Winterhof, A. (2018) · Designs Codes and Cryptography · doi:10.1007/s10623-018-0585-z · Cited by 1

Symbol Erasure Correction in Random Networks With Spread Codes

Gluesing-Luerssen, H., & Trautmann, A.-L. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2880767 · Cited by 1

Codes Over Trees

Yohananov, L., & Yaakobi, E. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3057939 · Cited by 1

Zero-divisor super-$$\lambda$$ graphs

Bennis, D., L’hamri, R., & Ouarghi, K. (2022) · São Paulo Journal of Mathematical Sciences · doi:10.1007/s40863-022-00311-1 · Cited by 1

Bounds on the Minimum Field Size of Network MDS Codes

Wei, H., & Schwartz, M. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3418471 · Cited by 1

Binary Codes for Correcting Asymmetric Adjacent Transpositions and Deletions

Wang, S., Vu, V. K., & Tan, V. Y. F. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3506918 · Cited by 1

On the Structure of the Schur Squares of Twisted Generalized Reed-Solomon Codes and Application to Cryptanalysis

Couvreur, A., Pratihar, R., Tanısalı, N., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86599-2_1 · Cited by 1

Error Correction Decoding Algorithms of RS Codes Based on an Earlier Termination Algorithm to Find the Error Locator Polynomial

Jiang, Z., Shi, H., Huang, Z., et al. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3539222 · Cited by 1

Explicit Constructions of Capacity-Achieving T-PIR Schemes Over Small Fields via Generalized Minor Matrices

Xu, J., & Fang, W. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3565288 · Cited by 1

Extensible decentralized secret sharing and application to Schnorr signatures

Battagliola, M., Longo, R., & Meneghetti, A. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01746-1 · Cited by 1

The t -Designs and the Subcode Support Weight Distributions of r -GMDS Codes

Pan, X., Liu, H., Zhang, J., et al. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3649882 · Cited by 1

Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields

Crane, E., Smith, K. C., Tomesh, T., Eickbusch, A., Martyn, J. M., Kühn, S., Funcke, L., DeMarco, M. A., Chuang, I. L., Wiebe, N., et al. (2026) · Physical Review X · doi:10.1103/s5bn-z4jq · Cited by 81

Trace Repair Never Loses to Classical Repair

Kim, W., Kruglik, S., & Kiah, H. M. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653992 · Cited by 1

Badania własności liczb pierwszych i wielomianów nieprzywiedlnych pod kątem zastosowania w telekomunikacji

Paszkiewicz, A. (2012) · Prace Naukowe Politechniki Warszawskiej. Elektronika · Cited by 1

Optimization of the Belief Propagation algorithm for Luby Transform decoding over the Binary Erasure Channel.

Guede, M. A. G. A. (2011) · Cited by 1

On Cyclic MDS-Codes

Shokrollahi, M. A. (2000) · Springer eBooks · doi:10.1007/978-3-642-59663-6_11 · Cited by 1

On the Incompressibility of Monotone DNFs

Krieger, M. P. (2005) · Lecture notes in computer science · doi:10.1007/11537311_4 · Cited by 1

Re-encoding techniques for interpolation-based decoding of Reed-Solomon codes

Senger, C. (2014) · Biennial Symposium on Communications · doi:10.1109/qbsc.2014.6841214 · Cited by 1

Syndrome decoding for Hermite codes with a Sugiyama-type algorithm

Bouw, I. I., & Kampf, S. (2012) · Advances in Mathematics of Communications · doi:10.3934/amc.2012.6.419 · Cited by 1

An Efficient Interpolation Based Erasure-Only Decoder for High-Rate Reed-Solomon Codes

Guo, Q., & Kan, H. (2012) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e95.a.978 · Cited by 1

Partial reverse concatenation for data storage

Cideciyan, R. D., Hutchins, R. A., Mittelholzer, T., et al. (2014) · doi:10.1109/apsipa.2014.7041670 · Cited by 1

On the Steiner quadruple systems of small rank which are embeddable into extended perfect binary codes

Kovalevskaya, D. I., & Solov’eva, F. I. (2013) · Journal of Applied and Industrial Mathematics · doi:10.1134/s1990478913010079 · Cited by 1

Fault tolerance in distributed systems : a coding-theoretic approach

Balasubramanian, B. (2012) · Cited by 1

Attack-Resilient Multitree Data Distribution Topologies

Grau, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35476-2_14 · Cited by 1

Investigation on data link layer ARQ and HARQ retransmission rates

Barukang, L., & Fan, L. C. (2010) · IEEE Student Conference on Research and Development (SCOReD) · doi:10.1109/scored.2010.5703986 · Cited by 1

Redundancy Setting Method for TCP Congestion Control Based on FEC over Wireless LAN

Teshima, F., Obata, H., Hamamoto, R., et al. (2015) · International Symposium on Computing and Networking · doi:10.1109/candar.2015.81 · Cited by 1

Asymptotically Good Codes

Niederreiter, H., & Özbudak, F. (2008) · Series on coding theory and cryptology · doi:10.1142/9789812794017_0005 · Cited by 1

Invariant embeddings of the Deligne-Lusztig curves with applications

Eid, A. (2013) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1

Generalized Concatenated Codes for Block and Device Failure Protection

Trifonov, P., & Wang, Y. (2016) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2016.12 · Cited by 1

A Decoding Approach to Reed–Solomon Codes from Their Definition

Bras-Amorós, M. (2018) · American Mathematical Monthly · doi:10.1080/00029890.2018.1420333 · Cited by 1

Reconciling similar sets

Gabrys, R., & Farnoud, F. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262865 · Cited by 1

Self-Predicting Boolean Functions

Weinberger, N., & Shayevitz, O. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437521 · Cited by 1

Secure Two-Party Computation over Unreliable Channels

Gelles, R., Paskin-Cherniavsky, A., & Zikas, V. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_24 · Cited by 1

State Recovery for Coarse-Grain TMR Designs in FPGAs Using Partial Reconfiguration

Schütz, M., Steininger, A., Huemer, F., et al. (2018) · IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT) · doi:10.1109/dft.2018.8602984 · Cited by 1

Error Correction by Structural Simplicity: Correcting Samplable Additive Errors

Yasunaga, K. (2018) · The Computer Journal · doi:10.1093/comjnl/bxy100 · Cited by 1

Threshold-Secure Coding With Shared Key

Aldaghri, N., & Mahdavifar, H. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3053020 · Cited by 1

Probabilistic Forwarding of Coded Packets on Networks

Kumar, B. R., & Kashyap, N. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849508 · Cited by 1

Asymptotic Bounds on the Rate of Locally Repairable Codes

Roth, R. M. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518239 · Cited by 1

Geometric extending of divisible codes and construction of new linear codes

Inoue, Y., & Maruta, T. (2020) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2020.101773 · Cited by 1

On the weight distribution of the cosets of MDS codes

Davydov, A. A., Marcugini, S., & Pambianco, F. (2021) · Advances in Mathematics of Communications · doi:10.3934/amc.2021042 · Cited by 1

On the non-trivial minimal blocking sets in binary projective spaces

Bono, N., Maruta, T., Shiromoto, K., et al. (2021) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2021.101814 · Cited by 1

Introduction to Information Theory and Data Science.

Rodrigues, M. R. D., Draper, S. C., Bajwa, W. U., & Eldar, Y. C. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108616799.002 · Cited by 1

Decoding of (Interleaved) Generalized Goppa Codes

Liu, H., Pircher, S., Zeh, A., & Wachter-Zeh, A. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517785 · Cited by 3

Storing and Transmission of Digital Audio Signals

Stanković, S., Orović, I., & Sejdić, E. (2012) · Springer eBooks · doi:10.1007/978-1-4614-4208-0_3 · Cited by 1

Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets

Kovačević, M. (2022) · Bulletin of the London Mathematical Society · doi:10.1112/blms.12699 · Cited by 1

Robust Group Testing-Based Multiple-Access Protocol for Massive MIMO

Vershinin, G., Cohen, A., & Gurewitz, O. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-34671-2_15 · Cited by 1

Recent Research in Polynomials [Working Title]

Özger, F. (2023) · IntechOpen eBooks · doi:10.5772/intechopen.1001517 · Cited by 1

Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes

Zhang, C., Shangguan, C., & Ge, G. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3296963 · Cited by 1

On Some Z m Linear Goppa/BCH like Error Control Codes and Elementary Symmetric Functions *

Tallini, L. G., & Bose, B. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206630 · Cited by 1

Introduction

Etzion, T. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-313517-0.00007-x · Cited by 1

Covert Communication by Exploiting Error-Correcting Codes

Marzin, A., Schwartz, M., & Segal, M. (2024) · International Conference on the Design of Reliable Communication Networks (DRCN) · doi:10.1109/drcn60692.2024.10539162 · Cited by 1

Invertible Bloom Lookup Tables with Listing Guarantees

Mizrahi, A., Bar-Lev, D., Yaakobi, E., et al. (2024) · doi:10.1145/3652963.3655060 · Cited by 1

Playing Guess Who with your kids: Code-word strategy against adversaries

Paz, A., & Peterfreund, L. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114766 · Cited by 1

Generator Polynomials of Cyclic Expurgated or Extended Goppa Codes

Jia, X., Li, F., Sun, H., & Yue, Q. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3462712 · Cited by 1

Performance of CA-Polar Codes Serial Concatenated with RLL Code Using SCL-SGRAND on VLC

Novid, I., Kamabe, H., & Lu, S. (2024) · International Symposium on Information Technology and Digital Innovation (ISITDI) · doi:10.1109/isitdi62380.2024.10796049 · Cited by 1

A Family of Optimal Linear Functional-Repair Regenerating Storage Codes

Hollmann, H. D. L. (2025) · Entropy · doi:10.3390/e27040376 · Cited by 1

Weighted Errors over a General Channel

Cicalese, F. (2013) · Monographs in theoretical computer science · doi:10.1007/978-3-642-17327-1_4 · Cited by 1

Hadamard’s Determinant Problem

Coppel, W. A. (2009) · Springer eBooks · doi:10.1007/978-0-387-89486-7_5 · Cited by 1

Rank for Some Families of Quaternary Reed-Muller Codes

Pernas, J., Pujol, J., & Villanueva, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02181-7_5 · Cited by 1

On the Automorphism Groups of the $$\mathbb{Z}_{2}\mathbb{Z}_{4}$$ -Linear Hadamard Codes and Their Classification

Krotov, D. S., & Villanueva, M. (2015) · CIM series in mathematical sciences · doi:10.1007/978-3-319-17296-5_25 · Cited by 1

Computation of Galois Groups in magma

Elsenhans, A.-S. (2016) · Springer eBooks · doi:10.1007/978-3-319-30379-6_56 · Cited by 1

A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications

Hamada, N., Maruta, T., & Oya, Y. (2012) · Serdica Journal of Computing · doi:10.55630/sjc.2012.6.253-266 · Cited by 1

TCP-TFEC: TCP Congestion Control based on Redundancy Setting Method for FEC over Wireless LAN

Teshima, F., Obata, H., Hamamoto, R., et al. (2017) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2017pap0017 · Cited by 1

Threshold-Secure Coding with Shared Key

Aldaghri, N., & Mahdavifar, H. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919868 · Cited by 1

Systematic and nonsystematic perfect codes of infinite length over finite fields

Malyugin, S. A. (2019) · Sibirskie Elektronnye Matematicheskie Izvestiya · doi:10.33048/semi.2019.16.122 · Cited by 1

Konstruksi Kode Reed-Solomon sebagai Kode Siklik dengan Polinomial Generator

Jamal, R. P., Haryanto, L., & Amir, A. K. (2014) · Hasanuddin University Repository · Cited by 1

Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks

Kamath, S., Deshpande, A., Subrahmanyam, K. V., & Balasubramanian, V. N. (2020) · Research Archive of Indian Institute of Technology Hyderabad (Indian Institute of Technology Hyderabad) · doi:10.48550/arxiv.2002.11318 · Cited by 4

E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication

Cadambe, V. R., Calmon, F. P., Devulapalli, A., & Jeong, H. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517861 · Cited by 1

Dual-containing Alternant Codes for Applications in the Calderbank-Shor-Steane Construction

Miao, S., & Senger, C. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518127 · Cited by 1

Low latency replication coded storage over memory -constrained servers

Jinan, R., Badita, A., Sarvepalli, P. K., et al. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517901 · Cited by 1

On the weight distribution of perfect binary codes

Pavone, M. (2021) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2021.1932898 · Cited by 1

Circulations

Jungnickel, D. (2012) · Algorithms and computation in mathematics · doi:10.1007/978-3-642-32278-5_10 · Cited by 1

Rate-Energy Optimal Probabilistic Shaping Using Linear Codes

Goukhshtein, M., Draper, S. C., & Mitra, J. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834402 · Cited by 1

Coding and bounds for partially defective memory cells

Kim, H. A., Puchinger, S., Tolhuizen, L., et al. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01270-0 · Cited by 1

Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC CodesPreprint

Huang, Q., Liu, K., & Wang, Z. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.0702 · Cited by 1

Polar Coding for Parallel ChannelsPreprint

Hof, E., Sason, I., Shamai, S. S., et al. (2010) · arXiv (Cornell University) · Cited by 1

The Solutions of the Third Power Sum Equation for Niho Type Decimations

Ranto, K., & Rosendahl, P. (2006) · Lecture notes in computer science · doi:10.1007/11617983_9 · Cited by 1

On the concatenation of turbo codes and Reed-Solomon codes

Zhou, G., Lin, T.-S., Wang, W., et al. (2004) · International Conference on Communications · doi:10.1109/icc.2003.1204021 · Cited by 7

A Class of Turbo-Like LDPC Codes and Their Decoding Based on Neural Network

Zhao, Z., Wu, X., & Yang, J. (2006) · IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications · doi:10.1109/mape.2005.1618080 · Cited by 1

Reed-Solomon Codes: Error Correcting Codes

Skoglund, I. (2020) · DiVA (Linnaeus University) · Cited by 1

Error control coding : fundamentals and applications

Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,330

Research on the Simulation of Block Turbo Codes

Yu, L. (2008) · Journal of Zhangzhou Normal University