| 2025 | ISIT | New Bounds and Constructions for Variable Packet-Error Coding. | Xiangliang Kong, Xin Wang, Ron M. Roth, Itzhak Tamo |
| 2025 | ISIT | Bounds on Box Codes. | Michael Langberg, Moshe Schwartz, Itzhak Tamo |
| 2025 | ISIT | Private Information Retrieval on Multigraph-Based Replicated Storage. | Shreya Meel, Xiangliang Kong, Thomas Jacob Maranzatto, Itzhak Tamo, Sennur Ulukus |
| 2024 | ISIT | Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. | Amit Berman, Yaron Shany, Itzhak Tamo |
| 2024 | ISIT | Non-Binary Covering Codes for Low-Access Computations. | Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo |
| 2024 | ISIT | Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes. | Itzhak Tamo |
| 2023 | ISIT | Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. | Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters |
| 2023 | ISIT | Access-Redundancy Tradeoffs in Quantized Linear Computations. | Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo |
| 2022 | ISIT | Reed Solomon Codes Against Adversarial Insertions and Deletions. | Roni Con, Amir Shpilka, Itzhak Tamo |
| 2022 | ISIT | Singleton-type bounds for list-decoding and list-recovery, and related results. | Eitan Goldberg, Chong Shangguan, Itzhak Tamo |
| 2021 | FOCS | Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. | Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters |
| 2021 | ISIT | Repairing Reed-Solomon Codes Evaluated on Subspaces. | Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo |
| 2021 | ISIT | Bounds on the Capacity of PIR over Graphs. | Bar Sadeh, Yujie Gu, Itzhak Tamo |
| 2021 | PKC | Multivariate Public Key Cryptosystem from Sidon Spaces. | Netanel Raviv, Ben Langton, Itzhak Tamo |
| 2020 | ISIT | Error Detection and Correction in Communication Networks. | Chong Shangguan, Itzhak Tamo |
| 2020 | STOC | Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. | Chong Shangguan, Itzhak Tamo |
| 2019 | ISIT | The Hat Guessing Number of Graphs. | Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo |
| 2019 | ISIT | Universally Sparse Hypergraphs with Applications to Coding Theory. | Chong Shangguan, Itzhak Tamo |
| 2018 | ICML | Gradient Coding from Cyclic MDS Codes and Expander Graphs. | Netanel Raviv, Rashish Tandon, Alex Dimakis, Itzhak Tamo |
| 2018 | ISIT | Minimum Guesswork with an Unreliable Oracle. | Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo |
| 2018 | ISIT | Private Information Retrieval is Graph Based Replication Systems. | Netanel Raviv, Itzhak Tamo |
| 2018 | USENIX | On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes. | Oleg Kolosov, Gala Yadgar, Matan Liram, Itzhak Tamo, Alexander Barg |
| 2017 | FOCS | Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound. | Itzhak Tamo, Min Ye, Alexander Barg |
| 2017 | ISIT | A bound on the shannon capacity via a linear programming variation. | Sihuang Hu, Itzhak Tamo, Ofer Shayevitz |
| 2017 | ISIT | A study on the impact of locality in the decoding of binary cyclic codes. | M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg |
| 2017 | ISIT | Cyclic subspace codes and sidon spaces. | Netanel Raviv, Itzhak Tamo |
| 2017 | ISIT | ∊-MSR codes with small sub-packetization. | Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko |
| 2017 | ISIT | Fractional decoding: Error correction from partial information. | Itzhak Tamo, Min Ye, Alexander Barg |
| 2016 | ISIT | Combinatorial and LP bounds for LRC codes. | Sihuang Hu, Itzhak Tamo, Alexander Barg |
| 2015 | ISIT | Locally recoverable codes on algebraic curves. | Alexander Barg, Itzhak Tamo, Serge G. Vladut |
| 2015 | ISIT | Cyclic LRC codes and their subfield subcodes. | Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank |
| 2014 | ISIT | A family of optimal locally recoverable codes. | Itzhak Tamo, Alexander Barg |
| 2014 | ISIT | Bounds on locally recoverable codes with multiple recovering sets. | Itzhak Tamo, Alexander Barg |
| 2013 | ISIT | Optimal locally repairable codes and connections to matroid theory. | Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis |
| 2012 | ISIT | Access vs. bandwidth in codes for storage. | Itzhak Tamo, Zhiying Wang, Jehoshua Bruck |
| 2012 | ISIT | Long MDS codes for optimal repair bandwidth. | Zhiying Wang, Itzhak Tamo, Jehoshua Bruck |
| 2011 | ISIT | On the labeling problem of permutation group codes under the infinity metric. | Itzhak Tamo, Moshe Schwartz |
| 2011 | ISIT | MDS array codes with optimal rebuilding. | Itzhak Tamo, Zhiying Wang, Jehoshua Bruck |
| 2011 | ITA | On optimal anticodes over permutations with the infinity norm. | Itzhak Tamo, Moshe Schwartz |
| 2010 | ITA | Correcting limited-magnitude errors in the rank-modulation scheme. | Itzhak Tamo, Moshe Schwartz |