| Reed Solomon codes against adversarial insertions and deletions R Con, A Shpilka, I Tamo IEEE Transactions on Information Theory 69 (5), 2991-3000, 2023 | 17* | 2023 |
| Improved constructions of coding schemes for the binary deletion channel and the Poisson repeat channel R Con, A Shpilka IEEE Transactions on Information Theory 68 (5), 2920-2940, 2022 | 16* | 2022 |
| Nonlinear repair of Reed-Solomon codes R Con, I Tamo IEEE Transactions on Information Theory 68 (8), 5165-5177, 2022 | 15* | 2022 |
| Repairing Reed-Solomon codes over prime fields via exponential sums R Con, N Shutty, I Tamo, M Wootters IEEE Transactions on Information Theory, 2024 | 6 | 2024 |
| Explicit and efficient constructions of linear codes against adversarial insertions and deletions R Con, A Shpilka, I Tamo IEEE Transactions on Information Theory 68 (10), 6516-6526, 2022 | 4 | 2022 |
| Improved upper and lower bounds on the capacity of the binary deletion channel I Rubinstein, R Con 2023 IEEE International Symposium on Information Theory (ISIT), 927-932, 2023 | 2 | 2023 |
| Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions R Con, A Shpilka, I Tamo IEEE Transactions on Information Theory, 2024 | 1 | 2024 |
| An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes S Singhvi, R Con, HM Kiah, E Yaakobi arXiv preprint arXiv:2403.07754, 2024 | 1 | 2024 |
| Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets R Con, Z Guo, R Li, Z Zhang arXiv preprint arXiv:2407.07299, 2024 | | 2024 |
| Robust Gray Codes Approaching the Optimal Rate R Con, D Fathollahi, R Gabrys, M Wootters, E Yaakobi arXiv preprint arXiv:2406.17689, 2024 | | 2024 |
| One Code Fits All: Strong stuck-at codes for versatile memory encoding R Con, R Gabrys, E Yaakobi arXiv preprint arXiv:2403.19061, 2024 | | 2024 |
Itzhak TamoTel-Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
