Itzhak Tamo
Tel Aviv University
H-index: 26
Asia-Israel
Top articles of Itzhak Tamo
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Improved list-decodability and list-recoverability of Reed–Solomon codes via tree packings | SIAM Journal on Computing | Zeyu Guo Ray Li Chong Shangguan Itzhak Tamo Mary Wootters | 2024/4/30 |
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions | IEEE Transactions on Information Theory | Roni Con Amir Shpilka Itzhak Tamo | 2024/4/11 |
Singleton-type bounds for list-decoding and list-recovery, and related results | Journal of Combinatorial Theory, Series A | Eitan Goldberg Chong Shangguan Itzhak Tamo | 2024/4/1 |
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity | arXiv preprint arXiv:2401.15034 | Amit Berman Yaron Shany Itzhak Tamo | 2024/1/26 |
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes | arXiv preprint arXiv:2305.17764 | Amit Berman Yaron Shany Itzhak Tamo | 2023/5/28 |
Points-Polynomials Incidence Theorem with Applications to Coding Theory | arXiv preprint arXiv:2312.12962 | Itzhak Tamo | 2023/12/20 |
Reed Solomon codes against adversarial insertions and deletions | IEEE Transactions on Information Theory | Roni Con Amir Shpilka Itzhak Tamo | 2023/1/18 |
Coefficient Complexity in Low-Access Quantized Linear Computations | Vinayak Ramkumar Netanel Raviv Itzhak Tamo | 2023/9/26 | |
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius | SIAM Journal on Computing | Chong Shangguan Itzhak Tamo | 2023/6/30 |
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums | Roni Con Noah Shutty Itzhak Tamo Mary Wootters | 2023/6/25 | |
Access-redundancy tradeoffs in quantized linear computations | Vinayak Ramkumar Netanel Raviv Itzhak Tamo | 2023/6/25 | |
Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes | arXiv preprint arXiv:2312.17097 | Itzhak Tamo | 2023/12/28 |
Explicit and efficient constructions of linear codes against adversarial insertions and deletions | IEEE Transactions on Information Theory | Roni Con Amir Shpilka Itzhak Tamo | 2022/5/9 |
Nonlinear repair of Reed-Solomon codes | IEEE Transactions on Information Theory | Roni Con Itzhak Tamo | 2022/4/14 |
A construction of maximally recoverable codes | Designs, Codes and Cryptography | Alexander Barg Zitan Chen Itzhak Tamo | 2022/4 |
List-decoding and list-recovery of Reed–Solomon codes beyond the Johnson radius for every rate | IEEE Transactions on Information Theory | Eitan Goldberg Chong Shangguan Itzhak Tamo | 2022/11/17 |
Bounds on the capacity of private information retrieval over graphs | IEEE Transactions on Information Forensics and Security | Bar Sadeh Yujie Gu Itzhak Tamo | 2022/11/4 |
Repairing Reed–Solomon codes evaluated on subspaces | IEEE Transactions on Information Theory | Amit Berman Sarit Buzaglo Avner Dor Yaron Shany Itzhak Tamo | 2022/5/25 |
Multivariate public key cryptosystem from sidon spaces | Netanel Raviv Ben Langton Itzhak Tamo | 2021/5/1 | |
Bounds on the Capacity of PIR over Graphs | Bar Sadeh Yujie Gu Itzhak Tamo | 2021/7/12 |
Co-Authors
