|
Link to the Homepage: Algebraic Coding Theory
| |
E-book: | |
![]() |
Guruswami, Venkatesan; Rudra, Atri and Sudan, Madhu Essential Coding Theory University at Buffalo 2019 |
Most important articles: | |
Braverman, Mark and Rao, Anup Towards Coding for Maximum Errors in Interactive Communication ACM 2011 | |
Cohen, Gil; Haeupler, Bernhard and Schulman, Leonard J. Explicit Binary Tree Codes with Polylogarithmic Size Alphabet ACM 2018 | |
Dvir, Zeev; Kopparty, Swastik; Saraf, Shubhangi and Sudan, Madhu Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers SIAM 2013 | |
Kopparty, Swastik; Saraf, Shubhangi and Yekhanin, Sergey High-Rate Codes with Sublinear-Time Decoding ACM 2014 | |
Rubinfeld, Ronitt and Sudan, Madhu Robust Characterizations of Polynomials with Applications to Program Testing SIAM 1996 |