On the Size of Optimal Anticodes over Permutations with the Infinity Norm - Itzhak Tamo; Moshe Schwartz 001 (CoRR, 2010)

Correcting limited-magnitude errors in the rank-modulation scheme. - Itzhak Tamo; Moshe Schwartz 001 (IEEE Trans. Inf. Theory, 2010)

On codes for optimal rebuilding access. - Zhiying Wang 001; Itzhak Tamo; Jehoshua Bruck (Allerton, 2011)

MDS array codes with optimal rebuilding. - Itzhak Tamo; Zhiying Wang 001; Jehoshua Bruck (ISIT, 2011)

On optimal anticodes over permutations with the infinity norm. - Itzhak Tamo; Moshe Schwartz 001 (ITA, 2011)

Optimal permutation anticodes with the infinity norm via permanents of (0, 1)-matrices. - Moshe Schwartz 001; Itzhak Tamo (J. Comb. Theory A, 2011)

Access vs. bandwidth in codes for storage. - Itzhak Tamo; Zhiying Wang 001; Jehoshua Bruck (ISIT, 2012)

Long MDS codes for optimal repair bandwidth. - Zhiying Wang 001; Itzhak Tamo; Jehoshua Bruck (ISIT, 2012)

On the Labeling Problem of Permutation Group Codes Under the Infinity Metric. - Itzhak Tamo; Moshe Schwartz 001 (IEEE Trans. Inf. Theory, 2012)

Zigzag Codes: MDS Array Codes With Optimal Rebuilding. - Itzhak Tamo; Zhiying Wang 001; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2013)

Bounds on locally recoverable codes with multiple recovering sets. - Itzhak Tamo; Alexander Barg (ISIT, 2014)

Explicit MDS Codes for Optimal Repair Bandwidth. - Zhiying Wang 001; Itzhak Tamo; Jehoshua Bruck (CoRR, 2014)

An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes. - Sreechakra Goparaju; Itzhak Tamo; A. Robert Calderbank (IEEE Trans. Inf. Theory, 2014)

A Family of Optimal Locally Recoverable Codes. - Itzhak Tamo; Alexander Barg (IEEE Trans. Inf. Theory, 2014)

Access Versus Bandwidth in Codes for Storage. - Itzhak Tamo; Zhiying Wang 001; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2014)

Cyclic LRC codes and their subfield subcodes. - Itzhak Tamo; Alexander Barg; Sreechakra Goparaju; A. Robert Calderbank (ISIT, 2015)

Combinatorial and LP bounds for LRC codes. - Sihuang Hu; Itzhak Tamo; Alexander Barg (ISIT, 2016)

Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. - Itzhak Tamo; Alexander Barg; Sreechakra Goparaju; A. Robert Calderbank (Int. J. Inf. Coding Theory, 2016)

Bounds on the Parameters of Locally Recoverable Codes. - Itzhak Tamo; Alexander Barg; Alexey A. Frolov (IEEE Trans. Inf. Theory, 2016)

Optimal Locally Repairable Codes and Connections to Matroid Theory. - Itzhak Tamo; Dimitris S. Papailiopoulos; Alexandros G. Dimakis (IEEE Trans. Inf. Theory, 2016)

Explicit Minimum Storage Regenerating Codes. - Zhiying Wang 001; Itzhak Tamo; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2016)

Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound. - Itzhak Tamo; Min Ye 005; Alexander Barg (FOCS, 2017)

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 (ISIT, 2017)

Cyclic subspace codes and sidon spaces. - Netanel Raviv; Itzhak Tamo (ISIT, 2017)

∊-MSR codes with small sub-packetization. - Ankit Singh Rawat; Itzhak Tamo; Venkatesan Guruswami; Klim Efremenko (ISIT, 2017)

Fractional decoding: Error correction from partial information. - Itzhak Tamo; Min Ye 005; Alexander Barg (ISIT, 2017)

Locally Recoverable Codes on Algebraic Curves. - Alexander Barg; Itzhak Tamo; Serge G. Vladut (IEEE Trans. Inf. Theory, 2017)

Optimal Rebuilding of Multiple Erasures in MDS Codes. - Zhiying Wang 001; Itzhak Tamo; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2017)

Private Information Retrieval is Graph Based Replication Systems. - Netanel Raviv; Itzhak Tamo (ISIT, 2018)

Optimal LRC codes for all lenghts n≤q. - Oleg Kolosov; Alexander Barg; Itzhak Tamo; Gala Yadgar (CoRR, 2018)

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size. - Itzhak Tamo; Min Ye 005; Alexander Barg (CoRR, 2018)

A Bound on the Shannon Capacity via a Linear Programming Variation. - Sihuang Hu; Itzhak Tamo; Ofer Shayevitz (SIAM J. Discret. Math., 2018)

Exploiting Locality for Improved Decoding of Binary Cyclic Codes. - M. Nikhil Krishnan; Bhagyashree Puranik; P. Vijay Kumar; Itzhak Tamo; Alexander Barg (IEEE Trans. Commun., 2018)

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. - Abhishek Agarwal; Alexander Barg; Sihuang Hu; Arya Mazumdar; Itzhak Tamo (IEEE Trans. Inf. Theory, 2018)

MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth. - Ankit Singh Rawat; Itzhak Tamo; Venkatesan Guruswami; Klim Efremenko (IEEE Trans. Inf. Theory, 2018)

Construction of Sidon Spaces With Applications to Coding. - Ron M. Roth; Netanel Raviv; Itzhak Tamo (IEEE Trans. Inf. Theory, 2018)

Universally Sparse Hypergraphs with Applications to Coding Theory. - Chong Shangguan; Itzhak Tamo (ISIT, 2019)

The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size. - Itzhak Tamo; Min Ye 005; Alexander Barg (IEEE Trans. Inf. Theory, 2019)

Error Detection and Correction in Communication Networks. - Chong Shangguan; Itzhak Tamo (ISIT, 2020)

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. - Chong Shangguan; Itzhak Tamo (STOC, 2020)

Improved List-Decodability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (Electron. Colloquium Comput. Complex., 2020)

Degenerate Turán densities of sparse hypergraphs. - Chong Shangguan; Itzhak Tamo (J. Comb. Theory A, 2020)

The hat guessing number of graphs. - Noga Alon; Omri Ben-Eliezer; Chong Shangguan; Itzhak Tamo (J. Comb. Theory B, 2020)

Sparse Hypergraphs with Applications to Coding Theory. - Chong Shangguan; Itzhak Tamo (SIAM J. Discret. Math., 2020)

New Turán Exponents for Two Extremal Hypergraph Problems. - Chong Shangguan; Itzhak Tamo (SIAM J. Discret. Math., 2020)

Minimum Guesswork With an Unreliable Oracle. - Natan Ardimanov; Ofer Shayevitz; Itzhak Tamo (IEEE Trans. Inf. Theory, 2020)

Gradient Coding From Cyclic MDS Codes and Expander Graphs. - Netanel Raviv; Itzhak Tamo; Rashish Tandon; Alexandros G. Dimakis (IEEE Trans. Inf. Theory, 2020)

Private Information Retrieval in Graph-Based Replication Systems. - Netanel Raviv; Itzhak Tamo; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2020)

Error Correction Based on Partial Information. - Itzhak Tamo; Min Ye 005; Alexander Barg (IEEE Trans. Inf. Theory, 2020)

On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes. - Oleg Kolosov; Gala Yadgar; Matan Liram; Itzhak Tamo; Alexander Barg (ACM Trans. Storage, 2020)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (FOCS, 2021)

Bounds on the Capacity of PIR over Graphs. - Bar Sadeh; Yujie Gu; Itzhak Tamo (ISIT, 2021)

List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. - Eitan Goldberg; Chong Shangguan; Itzhak Tamo (CoRR, 2021)

Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions. - Roni Con; Amir Shpilka; Itzhak Tamo (CoRR, 2021)

Multivariate Public Key Cryptosystem from Sidon Spaces. - Netanel Raviv; Ben Langton; Itzhak Tamo (IACR Cryptol. ePrint Arch., 2021)

Nonlinear Repair Schemes of Reed-Solomon Codes. - Roni Con; Itzhak Tamo (ITCS, 2022)

A construction of maximally recoverable codes. - Alexander Barg; Zitan Chen; Itzhak Tamo (Des. Codes Cryptogr., 2022)

Repairing Reed-Solomon Codes Evaluated on Subspaces. - Amit Berman; Sarit Buzaglo; Avner Dor; Yaron Shany; Itzhak Tamo (IEEE Trans. Inf. Theory, 2022)

Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions. - Roni Con; Amir Shpilka; Itzhak Tamo (IEEE Trans. Inf. Theory, 2022)

Nonlinear Repair of Reed-Solomon Codes. - Roni Con; Itzhak Tamo (IEEE Trans. Inf. Theory, 2022)

Coefficient Complexity in Low-Access Quantized Linear Computations. - Vinayak Ramkumar; Netanel Raviv; Itzhak Tamo (Allerton, 2023)

Points-Polynomials Incidence Theorem with Applications to Coding Theory. - Itzhak Tamo (CoRR, 2023)

Bounds on the Capacity of Private Information Retrieval Over Graphs. - Bar Sadeh; Yujie Gu; Itzhak Tamo (IEEE Trans. Inf. Forensics Secur., 2023)

List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate. - Eitan Goldberg; Chong Shangguan; Itzhak Tamo (IEEE Trans. Inf. Theory, 2023)

Reed Solomon Codes Against Adversarial Insertions and Deletions. - Roni Con; Amir Shpilka; Itzhak Tamo (IEEE Trans. Inf. Theory, 2023)

Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. - Chong Shangguan; Itzhak Tamo (SIAM J. Comput., 2023)

Non-Binary Covering Codes for Low-Access Computations. - Vinayak Ramkumar; Netanel Raviv; Itzhak Tamo (ISIT, 2024)

Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes. - Itzhak Tamo (ISIT, 2024)

ε-MSR Codes for Any Set of Helper Nodes. - Vinayak Ramkumar; Netanel Raviv; Itzhak Tamo (CoRR, 2024)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (SIAM J. Comput., 2024)

Singleton-type bounds for list-decoding and list-recovery, and related results. - Eitan Goldberg; Chong Shangguan; Itzhak Tamo (J. Comb. Theory A, 2024)

Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. - Roni Con; Amir Shpilka; Itzhak Tamo (IEEE Trans. Inf. Theory, 2024)

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes. - Amit Berman; Yaron Shany; Itzhak Tamo (IEEE Trans. Inf. Theory, 2024)

Access-Redundancy Tradeoffs in Quantized Linear Computations. - Vinayak Ramkumar; Netanel Raviv; Itzhak Tamo (IEEE Trans. Inf. Theory, 2024)

Repairing Reed-Solomon Codes Over Prime Fields via Exponential Sums. - Roni Con; Noah Shutty; Itzhak Tamo; Mary Wootters (IEEE Trans. Inf. Theory, 2024)

Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes. - Itzhak Tamo (IEEE Trans. Inf. Theory, 2024)

Quantum Locally Recoverable Codes via Good Polynomials. - Sandeep Sharma; Vinayak Ramkumar; Itzhak Tamo (IEEE J. Sel. Areas Inf. Theory, 2025)

Bounds on Box Codes. - Michael Langberg; Moshe Schwartz 001; Itzhak Tamo (CoRR, 2025)

Making it to First: The Random Access Problem in DNA Storage. - Avital Boruchovsky; Ohad Elishco; Ryan Gabrys; Anina Gruica; Itzhak Tamo; Eitan Yaakobi (CoRR, 2025)

Private Information Retrieval on Multigraph-Based Replicated Storage. - Shreya Meel; Xiangliang Kong; Thomas Jacob Maranzatto; Itzhak Tamo; Sennur Ulukus (CoRR, 2025)

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage. - Xiangliang Kong; Shreya Meel; Thomas Jacob Maranzatto; Itzhak Tamo; Sennur Ulukus (CoRR, 2025)

Corrections to "Reed Solomon Codes Against Adversarial Insertions and Deletions". - Roni Con; Amir Shpilka; Itzhak Tamo (IEEE Trans. Inf. Theory, 2025)

Combinatorial Alphabet-Dependent Bounds for Insdel Codes. - Xiangliang Kong; Itzhak Tamo; Hengjia Wei (IEEE Trans. Inf. Theory, 2025)

New Bounds and Constructions for Variable Packet-Error Coding. - Xiangliang Kong; Xin Wang; Ron M. Roth; Itzhak Tamo (CoRR, 2025)

Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List Decoding Capacity. - Amit Berman; Yaron Shany; Itzhak Tamo (IEEE Trans. Inf. Theory, 2025)