Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Itzhak Tamo
Observed names:
Tamo Itzhak,
Tamo, Itzhak
Institutions:
Ben-Gurion University of the Negev,
Tel Aviv University,
Samsung (Israel)
Observed institutions:
California Institute of Technology,
Ben-Gurion University of the Negev,
Beijing Institute of Technology,
Tel Aviv University,
Samsung (Israel),
University of Maryland, College Park,
Stanford University
show all 7
ORCID:
0000-0002-8000-0419
Observed ORCID:
0000-0002-8000-0419
OpenAlex ID:
A5085150941
Works
105
Awards
2
A Family of Optimal Locally Recoverable Codes
2014
·
Itzhak Tamo
, Alexander Barg
·
IEEE Transactions on Information Theory
·
662
PDF
Zigzag Codes: MDS Array Codes With Optimal Rebuilding
2012
·
Itzhak Tamo
, Zhiying Wang
, et al.
·
IEEE Transactions on Information Theory
·
419
PDF
Gradient Coding From Cyclic MDS Codes and Expander Graphs
2020
·
Netanel Raviv
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
200
PDF
Optimal Locally Repairable Codes and Connections to Matroid Theory
2016
·
Itzhak Tamo
, Dimitris S. Papailiopoulos
, et al.
·
IEEE Transactions on Information Theory
·
186
PDF
Bounds on the Parameters of Locally Recoverable Codes
2016
·
Itzhak Tamo
, Alexander Barg
, et al.
·
IEEE Transactions on Information Theory
·
159
PDF
Optimal locally repairable codes and connections to matroid theory
2013
·
Itzhak Tamo
, Dimitris S. Papailiopoulos
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
126
Locally Recoverable Codes on Algebraic Curves
2017
·
Alexander Barg
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
114
PDF
Access Versus Bandwidth in Codes for Storage
2014
·
Itzhak Tamo
, Zhiying Wang
, et al.
·
IEEE Transactions on Information Theory
·
107
On codes for optimal rebuilding access
2011
·
Zhiying Wang
, Itzhak Tamo
, et al.
·
Allerton Conference on Communication, Control, and Computing
·
106
PDF
Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
2010
·
Itzhak Tamo
, Moshe Schwartz
·
IEEE Transactions on Information Theory
·
102
PDF
Bounds on locally recoverable codes with multiple recovering sets
2014
·
Itzhak Tamo
, Alexander Barg
·
IEEE International Symposium on Information Theory (ISIT)
·
93
PDF
Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound
2017
·
Itzhak Tamo
, Min Ye
, et al.
·
Annual Symposium on Foundations of Computer Science
·
92
PDF
Cyclic LRC codes and their subfield subcodes
2015
·
Itzhak Tamo
, Alexander Barg
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
92
PDF
Explicit Minimum Storage Regenerating Codes
2016
·
Zhiying Wang
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
83
The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
2018
·
Itzhak Tamo
, Min Ye
, et al.
·
IEEE Transactions on Information Theory
·
80
PDF
An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
2014
·
Sreechakra Goparaju
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
78
PDF
MDS array codes with optimal rebuilding
2011
·
Itzhak Tamo
, Zhiying Wang
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
75
Private Information Retrieval in Graph-Based Replication Systems
2019
·
Netanel Raviv
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
70
PDF
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
2018
·
Ankit Singh Rawat
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
70
PDF
Construction of Sidon Spaces With Applications to Coding
2017
·
Ron M. Roth
, Netanel Raviv
, et al.
·
IEEE Transactions on Information Theory
·
69
PDF
Long MDS codes for optimal repair bandwidth
2012
·
Zhiying Wang
, Itzhak Tamo
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
68
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
2016
·
Itzhak Tamo
, Alexander Barg
, et al.
·
International Journal of Information and Coding Theory
·
66
PDF
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
2018
·
Abhishek Agarwal
, Alexander Barg
, et al.
·
IEEE Transactions on Information Theory
·
59
PDF
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
2020
·
Chong Shangguan
, Itzhak Tamo
·
ACM Symposium on Theory of Computing (STOC)
·
57
PDF
Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes
2024
·
Itzhak Tamo
·
IEEE Transactions on Information Theory
·
49
PDF
Show more works
View as search
Works count:
105
Citation count:
4,169
H-index:
28
I10-index:
60
Year
Topic
Type