I agree that this site is using cookies. You can find further informations here.
X
Tamo, Itzhak
92  results:
Search for persons X
?
1

Improved List-Decodability and List-Recoverability of Reed–..:

Guo, Zeyu ; Li, Ray ; Shangguan, Chong..
SIAM Journal on Computing.  53 (2024)  2 - p. 389-430 , 2024
Link: https://doi.org/10.1137/..
 
?
2

Tighter list-size bounds for list-decoding and recovery of ..:

Tamo, Itzhak
IEEE Transactions on Information Theory.  , 2024
Link: https://doi.org/10.1109/..
 
?
3

Optimal Two-Dimensional Reed–Solomon Codes Correcting Inser..:

Con, Roni ; Shpilka, Amir ; Tamo, Itzhak
IEEE Transactions on Information Theory.  70 (2024)  7 - p. 5012-5016 , 2024
Link: https://doi.org/10.1109/..
 
?
4

Singleton-type bounds for list-decoding and list-recovery, ..:

Goldberg, Eitan ; Shangguan, Chong ; Tamo, Itzhak
Journal of Combinatorial Theory, Series A.  203 (2024)  - p. 105835 , 2024
Link: https://doi.org/10.1016/..
 
?
5

Access-Redundancy Tradeoffs in Quantized Linear Computation:

Ramkumar, Vinayak ; Raviv, Netanel ; Tamo, Itzhak
IEEE Transactions on Information Theory.  , 2024
Link: https://doi.org/10.1109/..
 
?
6

Generalized Singleton Bound and List-Decoding Reed–Solomon ..:

Shangguan, Chong ; Tamo, Itzhak
SIAM Journal on Computing.  52 (2023)  3 - p. 684-717 , 2023
Link: https://doi.org/10.1137/..
 
?
7

Reed Solomon Codes Against Adversarial Insertions and Delet..:

Con, Roni ; Shpilka, Amir ; Tamo, Itzhak
IEEE Transactions on Information Theory.  69 (2023)  5 - p. 2991-3000 , 2023
Link: https://doi.org/10.1109/..
 
?
8

Repairing Reed-Solomon Codes over Prime Fields via Exponent..:

, In: 2023 IEEE International Symposium on Information Theory (ISIT),
Con, Roni ; Shutty, Noah ; Tamo, Itzhak. - p. 1330-1335 , 2023
Link: https://doi.org/10.1109/..
 
?
9

List-Decoding and List-Recovery of Reed–Solomon Codes Beyon..:

Goldberg, Eitan ; Shangguan, Chong ; Tamo, Itzhak
IEEE Transactions on Information Theory.  69 (2023)  4 - p. 2261-2268 , 2023
Link: https://doi.org/10.1109/..
 
?
10

Coefficient Complexity in Low-Access Quantized Linear Compu..:

, In: 2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton),
Ramkumar, Vinayak ; Raviv, Netanel ; Tamo, Itzhak - p. 1-8 , 2023
Link: https://doi.org/10.1109/..
 
?
11

Access-Redundancy Tradeoffs in Quantized Linear Computation:

, In: 2023 IEEE International Symposium on Information Theory (ISIT),
Ramkumar, Vinayak ; Raviv, Netanel ; Tamo, Itzhak - p. 1967-1972 , 2023
Link: https://doi.org/10.1109/..
 
?
12

Repairing Reed–Solomon Codes Evaluated on Subspaces:

Berman, Amit ; Buzaglo, Sarit ; Dor, Avner..
IEEE Transactions on Information Theory.  68 (2022)  10 - p. 6505-6515 , 2022
Link: https://doi.org/10.1109/..
 
?
13

Explicit and Efficient Constructions of Linear Codes Agains..:

Con, Roni ; Shpilka, Amir ; Tamo, Itzhak
IEEE Transactions on Information Theory.  68 (2022)  10 - p. 6516-6526 , 2022
Link: https://doi.org/10.1109/..
 
?
14

Reed Solomon Codes Against Adversarial Insertions and Delet..:

, In: 2022 IEEE International Symposium on Information Theory (ISIT),
Con, Roni ; Shpilka, Amir ; Tamo, Itzhak - p. 2940-2945 , 2022
Link: https://doi.org/10.1109/..
 
?
15

A construction of maximally recoverable codes:

Barg, Alexander ; Chen, Zitan ; Tamo, Itzhak
Designs, Codes and Cryptography.  90 (2022)  4 - p. 939-945 , 2022
Link: https://doi.org/10.1007/..
 
1-15