Preprints
D. Edidin, I. Gonzalez, and I. Tamo, Pure-State Quantum Tomography With Minimal Rank-One POVMs
submitted to Physical Review A
I. Tamo, T. Jacob Maranzatto, and S. Ulukus, Approximate Gradient Coding with Partial Computations: Scaling Laws, Serialization Effects, and Design Rules
submitted to MLSys 2026
X. Kong, X. Wang, R. M. Roth, and I. Tamo, New Bounds and Constructions for Variable Packet-Error Coding
submitted to IEEE Transactions on Information Theory
A. Boruchovsky, O. Elishco, R. Gabrys, A. Gruica, I. Tamo, and E. Yaakobi, Making it to First: The Random Access Problem in DNA Storage
submitted to IEEE Transactions on Information Theory
C. Shangguan, and I. Tamo, Error Detection and Correction in Communication Networks
Journal Publications
X. Kong, S. Meel, T. Jacob Maranzatto, I. Tamo, and S. Ulukus, New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
accepted to IEEE Transactions on Information Theory
S. Sharma, V. Ramkumar, and I. Tamo, Quantum Locally Recoverable Codes via Good Polynomials, IEEE Journal on Selected Areas in Information
V. Ramkumar, N. Raviv, and I. Tamo, epsilon-MSR Codes for Any Set of Helper Nodes
IEEE Transactions on Information Theory
SIAM J. Discrete Math
X. Kong, and I. Tamo, A Point-Variety Incidence Theorem Over Finite Fields, and Its Applications
SIAM J. Discrete Math
X. Kong, I. Tamo, and H. Wei, Combinatorial Alphabet-Dependent Bounds for Insdel Codes
IEEE Transactions on Information Theory
A. Berman, Y. Shany, and I. Tamo, Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List-Decoding Capacity
IEEE Transactions on Information Theory
A. Berman, Y. Shany, I. Tamo, Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
IEEE Transactions on Information Theory
V. Ramkumar, N. Raviv, and I. Tamo, Access-Redundancy Tradeoffs in Quantized Linear Computations
IEEE Transactions on Information Theory
R. Con, N. Shutty, I. Tamo, and M. Wootters, Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
R. Con, A. Shpilka, I. Tamo, Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions
IEEE Transactions on Information Theory
E. Goldberg, C. Shangguan, and I. Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results
Journal of Combinatorial Theory, Series A
R. Con, and I. Tamo, Nonlinear Repair of Reed-Solomon Codes
IEEE Transactions on Information Theory
R. Con, A. Shpilka, and I. Tamo, Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions
IEEE Transactions on Information Theory
Z. Guo, R. Li, C. Shangguan, I. Tamo, M. Wootters, Improved List-Decodability of Reed--Solomon Codes via Tree Packings
SIAM Journal on Computing
A. Berman, S. Buzaglo, A. Dor, Y. Shany, and I. Tamo, Repairing Reed-Solomon Codes Evaluated on Subspaces
IEEE Transactions on Information Theory
B. Sadeh, Y. Gu, and I. Tamo, Bounds on the Capacity of Private Information Retrieval over Graphs
IEEE Transactions on Information Forensics and Security
E. Goldberg, C. Shangguan, and I. Tamo, List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
IEEE Transactions on Information Theory
R. Con, A. Shpilka, and I. Tamo, Reed Solomon Codes Against Adversarial Insertions and Deletions
IEEE Transactions on Information Theory
A. Barg, Z. Chen, and I. Tamo, A construction of maximally recoverable codes
Designs, Codes and Cryptography
C. Shangguan, and I. Tamo, Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
SIAM Journal on Computing
C. Shangguan, and I. Tamo, New Tur´an exponents for two extremal hypergraph problems
SIAM Journal on Discrete Mathematics
C. Shangguan, and I. Tamo, Degenerate Tur´an densities of sparse hypergraphs
Journal of Combinatorial Theory
C. Shangguan, and I. Tamo, Sparse Hypergraphs with Applications to Coding Theory
SIAM Journal on Discrete Mathematics
N. Ardimanov, O. Shayevitz, I. Tamo, Minimum Guesswork with an Unreliable Oracle
IEEE Transactions on Information Theory
N. Raviv, I. Tamo, R. Tandon, and A. Dimakis, Gradient Coding from Cyclic MDS Codes and Expander Graphs
IEEE Transactions on Information Theory
N. Alon, O. Ben-Eliezer, C. Shangguan, and I. Tamo, The hat guessing number of graphs
Journal of Combinatorial Theory, Series B
N. Raviv, I. Tamo, and E. Yaakobi, Private Information Retrieval in Graph-Based Replication Systems
IEEE Transactions on Information Theory
O. Kolosov, G. Yadgar, M. Liram, I. Tamo, and A. Barg, On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes
ACM Transactions on Storage
I. Tamo, M. Ye, and A. Barg, Error correction based on partial information
IEEE Transactions on Information Theory
I. Tamo, M. Ye, and A. Barg, The Repair Problem for Reed-Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size
IEEE Transactions on Information Theory
S. Hu, I. Tamo, and O. Shayevitz, A Bound on the Shannon Capacity via a Linear Programming Variation
SIAM Journal on Discrete Mathematics
N. M. Krishnan, B. Puranik, P. V. Kumar, I. Tamo, and A. Barg, Exploiting Locality for Improved Decoding of Binary Cyclic Codes
IEEE Transactions on Communications
A. Rawat, I. Tamo, V. Guruswami, and K. Efremenko, MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
IEEE Transactions on Information Theory
R. M. Roth, N. Raviv, and I. Tamo, Construction of Sidon spaces with applications to coding
IEEE Transactions on Information Theory
A. Agarwal, A. Barg, S. Hu, A. Mazumdar, and I. Tamo, Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
IEEE Transactions on Information Theory
A. Barg, I. Tamo and S. Vladut, Locally Recoverable Codes on Algebraic Curves
IEEE Transactions on Information Theory
Z. Wang, I. Tamo, and J. Bruck, Optimal Rebuilding of Multiple Erasures in MDS Codes
IEEE Transactions on Information Theory
I. Tamo, D. S. Papailiopoulos, and A. G. Dimakis, Optimal Locally Repairable Codes and Connections to Matroid Theory
IEEE Transactions on Information Theory
I. Tamo, A. Barg, S. Goparaju, and R. Calderbank, Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes
Int. J. of Information and Coding Theory
Z. Wang, I. Tamo, and J. Bruck, Explicit Minimum Storage Regenerating Codes
IEEE Transactions on Information Theory
I. Tamo, A. Barg, and A. Frolov, Bounds on the parameters of Locally Recoverable Codes
IEEE Transactions on Information Theory
I. Tamo and A. Barg, A Family of Optimal Locally Recoverable Codes
IEEE Transactions on Information Theory
S. Goparaju, I. Tamo, and R. Calderbank, An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
IEEE Transactions on Information Theory
I. Tamo, Z. Wang and J. Bruck, Access Versus Bandwidth in Codes for Storage
IEEE Transactions on Information Theory
I. Tamo, Z. Wang, and J. Bruck, Zigzag Codes: MDS Array Codes With Optimal Rebuilding
IEEE Transactions on Information Theory
I. Tamo and M. Schwartz, On the Labeling Problem of Permutation Group Codes under the Infinity Metric
IEEE Transactions on Information Theory
M. Schwartz and I. Tamo, Optimal permutation anticodes with the infinity norm via permanents of (0, 1) matrices
Journal of Combinatorial Theory Series A
I. Tamo and M. Schwartz, Correcting Limited-Magnitude Errors in the Rank- Modulation Scheme”
IEEE Transactions on Information Theory
Z. Guo, R. Li, C. Shangguan, I. Tamo, and M. Wootters, Improved List-Decodability of Reed--Solomon Codes via Tree Packings, FOCS 2021, Symposium on Foundations of Computer Science
N. Raviv, B. Langton, and I. Tamo, Multivariate Public Key Cryptosystem from Sidon Spaces , PKC 2021, the 24th edition of the International Conference on Practice and Theory of Public-Key Cryptography
C. Shangguan, and I. Tamo, Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius, STOC 2020, Symposium on Theory of Computing
N. Raviv, R. Tandon, A. Dimakis, and I. Tamo, Gradient Coding from Cyclic MDS Codes and Expander Graphs, ICML 2018, International Conference on Machine Learning
O. Kolosov, G. Yadgar, M. Liram, I. Tamo, and A. Barg, On Fault Tolerance, Locality, and Optimality of Locally Repairable Codes, 2018 USENIX Annual Technical Conference
I. Tamo, M. Ye, and A. Barg, Optimal repair of Reed-Solomon codes: Achieving the cut set bound
FOCS 2017, Symposium on Foundations of Computer Science