Itzhak Tamo

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 97

Top Venues

CoRR

IEEE Trans. Inf. Theory

ISIT

SIAM J. Discret. Math.

Publications

Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53 (2) (2024)
Roni Con, Amir Shpilka, Itzhak Tamo
Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 70 (7) (2024)
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Non-Binary Covering Codes for Low-Access Computations. CoRR (2024)
Amit Berman, Yaron Shany, Itzhak Tamo
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. CoRR (2024)
Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. CoRR (2024)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Singleton-type bounds for list-decoding and list-recovery, and related results. J. Comb. Theory, Ser. A 203 (2024)
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Access-Redundancy Tradeoffs in Quantized Linear Computations. ISIT (2023)
Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. ISIT (2023)
Amit Berman, Yaron Shany, Itzhak Tamo
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes. CoRR (2023)
Chong Shangguan, Itzhak Tamo
Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius. SIAM J. Comput. 52 (3) (2023)
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Access-Redundancy Tradeoffs in Quantized Linear Computations. CoRR (2023)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate. IEEE Trans. Inf. Theory 69 (4) (2023)
Roni Con, Amir Shpilka, Itzhak Tamo
Reed Solomon Codes Against Adversarial Insertions and Deletions. IEEE Trans. Inf. Theory 69 (5) (2023)
Roni Con, Amir Shpilka, Itzhak Tamo
Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. CoRR (2023)
Itzhak Tamo
Points-Polynomials Incidence Theorem with Applications to Coding Theory. CoRR (2023)
Bar Sadeh, Yujie Gu, Itzhak Tamo
Bounds on the Capacity of Private Information Retrieval Over Graphs. IEEE Trans. Inf. Forensics Secur. 18 (2023)
Itzhak Tamo
Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes. CoRR (2023)
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Coefficient Complexity in Low-Access Quantized Linear Computations. Allerton (2023)
Roni Con, Amir Shpilka, Itzhak Tamo
Reed Solomon Codes Against Adversarial Insertions and Deletions. ISIT (2022)
Roni Con, Itzhak Tamo
Nonlinear Repair Schemes of Reed-Solomon Codes. ITCS (2022)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS (2022)
Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
Repairing Reed-Solomon Codes Evaluated on Subspaces. IEEE Trans. Inf. Theory 68 (10) (2022)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Singleton-type bounds for list-decoding and list-recovery, and related results. ISIT (2022)
Alexander Barg, Zitan Chen, Itzhak Tamo
A construction of maximally recoverable codes. Des. Codes Cryptogr. 90 (4) (2022)
Roni Con, Amir Shpilka, Itzhak Tamo
Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions. IEEE Trans. Inf. Theory 68 (10) (2022)
Roni Con, Itzhak Tamo
Nonlinear Repair of Reed-Solomon Codes. IEEE Trans. Inf. Theory 68 (8) (2022)
Roni Con, Amir Shpilka, Itzhak Tamo
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions. CoRR (2022)
Roni Con, Itzhak Tamo
Nonlinear Repair Schemes of Reed-Solomon Codes. CoRR (2021)
Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
Repairing Reed-Solomon Codes Evaluated on Subspaces. ISIT (2021)
Bar Sadeh, Yujie Gu, Itzhak Tamo
Bounds on the Capacity of PIR over Graphs. CoRR (2021)
Alexander Barg, Zitan Chen, Itzhak Tamo
A construction of maximally recoverable codes. CoRR (2021)
Netanel Raviv, Ben Langton, Itzhak Tamo
Multivariate Public Key Cryptosystem from Sidon Spaces. CoRR (2021)
Bar Sadeh, Yujie Gu, Itzhak Tamo
Bounds on the Capacity of PIR over Graphs. ISIT (2021)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Singleton-type bounds for list-decoding and list-recovery, and related results. CoRR (2021)
Netanel Raviv, Ben Langton, Itzhak Tamo
Multivariate Public Key Cryptosystem from Sidon Spaces. Public Key Cryptography (1) (2021)
Netanel Raviv, Ben Langton, Itzhak Tamo
Multivariate Public Key Cryptosystem from Sidon Spaces. IACR Cryptol. ePrint Arch. 2021 (2021)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS (2021)
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate. CoRR (2021)
Roni Con, Amir Shpilka, Itzhak Tamo
Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions. CoRR (2021)
Netanel Raviv, Itzhak Tamo, Rashish Tandon, Alexandros G. Dimakis
Gradient Coding From Cyclic MDS Codes and Expander Graphs. IEEE Trans. Inf. Theory 66 (12) (2020)
Chong Shangguan, Itzhak Tamo
Degenerate Turán densities of sparse hypergraphs. J. Comb. Theory, Ser. A 173 (2020)
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
The hat guessing number of graphs. J. Comb. Theory, Ser. B 144 (2020)
Chong Shangguan, Itzhak Tamo
Error Detection and Correction in Communication Networks. CoRR (2020)
Chong Shangguan, Itzhak Tamo
Sparse Hypergraphs with Applications to Coding Theory. SIAM J. Discret. Math. 34 (3) (2020)
Chong Shangguan, Itzhak Tamo
Error Detection and Correction in Communication Networks. ISIT (2020)
Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
Repairing Reed-Solomon Codes Evaluated on Subspaces. CoRR (2020)
Chong Shangguan, Itzhak Tamo
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. STOC (2020)
Oleg Kolosov, Gala Yadgar, Matan Liram, Itzhak Tamo, Alexander Barg
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes. ACM Trans. Storage 16 (2) (2020)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR (2020)
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
Minimum Guesswork With an Unreliable Oracle. IEEE Trans. Inf. Theory 66 (12) (2020)
Netanel Raviv, Itzhak Tamo, Eitan Yaakobi
Private Information Retrieval in Graph-Based Replication Systems. IEEE Trans. Inf. Theory 66 (6) (2020)
Chong Shangguan, Itzhak Tamo
New Turán Exponents for Two Extremal Hypergraph Problems. SIAM J. Discret. Math. 34 (4) (2020)
Itzhak Tamo, Min Ye, Alexander Barg
Error Correction Based on Partial Information. IEEE Trans. Inf. Theory 66 (3) (2020)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. 27 (2020)
Chong Shangguan, Itzhak Tamo
Universally Sparse Hypergraphs with Applications to Coding Theory. CoRR (2019)
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
The Hat Guessing Number of Graphs. ISIT (2019)
Chong Shangguan, Itzhak Tamo
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. CoRR (2019)
Itzhak Tamo, Min Ye, Alexander Barg
The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size. IEEE Trans. Inf. Theory 65 (5) (2019)
Chong Shangguan, Itzhak Tamo
Universally Sparse Hypergraphs with Applications to Coding Theory. ISIT (2019)
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
Minimum Guesswork with an Unreliable Oracle. ISIT (2018)
Oleg Kolosov, Alexander Barg, Itzhak Tamo, Gala Yadgar
Optimal LRC codes for all lenghts n≤q. CoRR (2018)
Oleg Kolosov, Gala Yadgar, Matan Liram, Itzhak Tamo, Alexander Barg
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes. USENIX Annual Technical Conference (2018)
Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth. IEEE Trans. Inf. Theory 64 (10) (2018)
Netanel Raviv, Itzhak Tamo
Private Information Retrieval is Graph Based Replication Systems. ISIT (2018)
Itzhak Tamo, Min Ye, Alexander Barg
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size. CoRR (2018)
Netanel Raviv, Itzhak Tamo, Eitan Yaakobi
Private Information Retrieval in Graph Based Replication Systems. CoRR (2018)
Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. IEEE Trans. Inf. Theory 64 (5) (2018)
Ron M. Roth, Netanel Raviv, Itzhak Tamo
Construction of Sidon Spaces With Applications to Coding. IEEE Trans. Inf. Theory 64 (6) (2018)
M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg
Exploiting Locality for Improved Decoding of Binary Cyclic Codes. IEEE Trans. Commun. 66 (6) (2018)
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
A Bound on the Shannon Capacity via a Linear Programming Variation. SIAM J. Discret. Math. 32 (3) (2018)
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
The hat guessing number of graphs. CoRR (2018)
Netanel Raviv, Rashish Tandon, Alex Dimakis, Itzhak Tamo
Gradient Coding from Cyclic MDS Codes and Expander Graphs. ICML (2018)
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
Minimum Guesswork with an Unreliable Oracle. CoRR (2018)
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
A Bound on the Shannon Capacity via a Linear Programming Variation. CoRR (2018)
M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg
A study on the impact of locality in the decoding of binary cyclic codes. ISIT (2017)
Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. CoRR (2017)
Itzhak Tamo, Min Ye, Alexander Barg
Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound. FOCS (2017)
Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko
∊-MSR codes with small sub-packetization. ISIT (2017)
Netanel Raviv, Itzhak Tamo, Rashish Tandon, Alexandros G. Dimakis
Gradient Coding from Cyclic MDS Codes and Expander Graphs. CoRR (2017)
Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth. CoRR (2017)
Itzhak Tamo, Min Ye, Alexander Barg
Optimal repair of Reed-Solomon codes: Achieving the cut-set bound. CoRR (2017)
Zhiying Wang, Itzhak Tamo, Jehoshua Bruck
Optimal Rebuilding of Multiple Erasures in MDS Codes. IEEE Trans. Inf. Theory 63 (2) (2017)
Netanel Raviv, Itzhak Tamo
Cyclic subspace codes and sidon spaces. ISIT (2017)
Itzhak Tamo, Min Ye, Alexander Barg
Fractional decoding: Error correction from partial information. CoRR (2017)
M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes. CoRR (2017)
Alexander Barg, Itzhak Tamo, Serge G. Vladut
Locally Recoverable Codes on Algebraic Curves. IEEE Trans. Inf. Theory 63 (8) (2017)
Itzhak Tamo, Min Ye, Alexander Barg
Fractional decoding: Error correction from partial information. ISIT (2017)
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
A bound on the shannon capacity via a linear programming variation. ISIT (2017)
Ron M. Roth, Netanel Raviv, Itzhak Tamo
Construction of Sidon spaces with applications to coding. CoRR (2017)
Itzhak Tamo, Alexander Barg, Alexey A. Frolov
Bounds on the Parameters of Locally Recoverable Codes. IEEE Trans. Inf. Theory 62 (6) (2016)
Alexander Barg, Itzhak Tamo, Serge G. Vladut
Locally recoverable codes on algebraic curves. CoRR (2016)
Zhiying Wang, Itzhak Tamo, Jehoshua Bruck
Optimal Rebuilding of Multiple Erasures in MDS Codes. CoRR (2016)
Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis
Optimal Locally Repairable Codes and Connections to Matroid Theory. IEEE Trans. Inf. Theory 62 (12) (2016)
Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. Int. J. Inf. Coding Theory 3 (4) (2016)
Zhiying Wang, Itzhak Tamo, Jehoshua Bruck
Explicit Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 62 (8) (2016)
Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank
Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes. CoRR (2016)
Sihuang Hu, Itzhak Tamo, Alexander Barg
Combinatorial and LP bounds for LRC codes. ISIT (2016)
Alexander Barg, Itzhak Tamo, Serge G. Vladut
Locally recoverable codes on algebraic curves. ISIT (2015)
Itzhak Tamo, Alexander Barg, Alexey A. Frolov
Bounds on the Parameters of Locally Recoverable Codes. CoRR (2015)
Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank
Cyclic LRC Codes and their Subfield Subcodes. CoRR (2015)

Itzhak Tamo.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Itzhak Tamo