Itzhak Tamo

Citeras av

	Alla	Sedan 2016
Citat	2087	1648
h-index	21	20
i10-index	28	27

360

180

270

20102011201220132014201520162017201820192020202111 21 28 70 126 169 250 355 352 353 321 3

Medförfattare

Alexander BargUniversity of MarylandVerifierad e-postadress på umd.edu
Jehoshua BruckGordon and Betty Moore Professor, CaltechVerifierad e-postadress på caltech.edu
Zhiying WangUniversity of California, IrvineVerifierad e-postadress på uci.edu
Moshe SchwartzElectrical and Computer Engineering, Ben-Gurion University of the Negev, IsraelVerifierad e-postadress på ee.bgu.ac.il
Alexandros G DimakisProfessor, ECE University of Texas at AustinVerifierad e-postadress på austin.utexas.edu
Netanel RavivWashington University in St. LouisVerifierad e-postadress på email.wustl.edu
Chong Shangguan（上官冲）Shandong UniversityVerifierad e-postadress på zju.edu.cn
Sreechakra GoparajuFacebook, Inc.Verifierad e-postadress på fb.com
R. CalderbankBell Labs, AT&T Labs, Princeton University, Duke UniversityVerifierad e-postadress på duke.edu
Min YeTsinghua-Berkeley Shenzhen InstituteVerifierad e-postadress på sz.tsinghua.edu.cn
Dimitris PapailiopoulosAssistant Professor, University of Wisconsin-MadisonVerifierad e-postadress på papail.io
Venkatesan GuruswamiCarnegie Mellon UniversityVerifierad e-postadress på cmu.edu
Klim EfremenkoComputer Science Ben- Gurion UniversityVerifierad e-postadress på cs.bgu.ac.il
Rashish TandonAppleVerifierad e-postadress på apple.com
Alexey FrolovSkolkovo Institute of Science and TechnologyVerifierad e-postadress på skoltech.ru
Gala YadgarComputer Science, Technion- Israel Institute of TechnologyVerifierad e-postadress på cs.technion.ac.il
Ankit Singh RawatResearch Scientist, GoogleVerifierad e-postadress på google.com
Serge VladutsProfessor of Mathematics, Aix-Marseille UniversityVerifierad e-postadress på univ-amu.fr
Bhagyashree PuranikUC Santa BarbaraVerifierad e-postadress på ucsb.edu
P Vijay KumarProfessor, Indian Institute of Science; Adjunct Research Professor, USCVerifierad e-postadress på iisc.ac.in

Itzhak Tamo

Tel-Aviv University

Verifierad e-postadress på tauex.tau.ac.il - Startsida

coding theory storage systems information theory combinatorics and algebraic tools in combinatorics


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
A family of optimal locally recoverable codes I Tamo, A Barg IEEE Transactions on Information Theory 60 (8), 4661-4676, 2014	397	2014
Zigzag codes: MDS array codes with optimal rebuilding I Tamo, Z Wang, J Bruck IEEE Transactions on Information Theory 59 (3), 1597-1616, 2012	290	2012
Optimal locally repairable codes and connections to matroid theory I Tamo, DS Papailiopoulos, AG Dimakis IEEE Transactions on Information Theory 62 (12), 6661-6671, 2016	188	2016
Correcting limited-magnitude errors in the rank-modulation scheme I Tamo, M Schwartz IEEE Transactions on Information Theory 56 (6), 2551-2560, 2010	92	2010
Gradient coding from cyclic MDS codes and expander graphs N Raviv, R Tandon, A Dimakis, I Tamo International Conference on Machine Learning, 4305-4313, 2018	89	2018
Bounds on the parameters of locally recoverable codes I Tamo, A Barg, A Frolov IEEE Transactions on information theory 62 (6), 3070-3083, 2016	88	2016
Access versus bandwidth in codes for storage I Tamo, Z Wang, J Bruck IEEE Transactions on Information Theory 60 (4), 2028-2037, 2014	87*	2014
On codes for optimal rebuilding access Z Wang, I Tamo, J Bruck 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011	79	2011
Bounds on locally recoverable codes with multiple recovering sets I Tamo, A Barg 2014 IEEE International Symposium on Information Theory, 691-695, 2014	78	2014
MDS array codes with optimal rebuilding I Tamo, Z Wang, J Bruck 2011 IEEE International Symposium on Information Theory Proceedings, 1240-1244, 2011	78	2011
An improved sub-packetization bound for minimum storage regenerating codes S Goparaju, I Tamo, R Calderbank IEEE Transactions on Information Theory 60 (5), 2770-2779, 2014	65	2014
Cyclic LRC codes and their subfield subcodes I Tamo, A Barg, S Goparaju, R Calderbank 2015 IEEE International Symposium on Information Theory (ISIT), 1262-1266, 2015	63	2015
Long MDS codes for optimal repair bandwidth Z Wang, I Tamo, J Bruck 2012 IEEE International Symposium on Information Theory Proceedings, 1182-1186, 2012	58	2012
Locally recoverable codes on algebraic curves A Barg, I Tamo, S Vlăduţ IEEE Transactions on Information Theory 63 (8), 4928-4939, 2017	55	2017
Optimal repair of Reed-Solomon codes: Achieving the cut-set bound I Tamo, M Ye, A Barg 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	37	2017
Explicit minimum storage regenerating codes Z Wang, I Tamo, J Bruck IEEE Transactions on Information Theory 62 (8), 4466-4480, 2016	33	2016
Combinatorial alphabet-dependent bounds for locally recoverable codes A Agarwal, A Barg, S Hu, A Mazumdar, I Tamo IEEE Transactions on Information Theory 64 (5), 3481-3492, 2018	26	2018
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes I Tamo, A Barg, S Goparaju, R Calderbank International Journal of Information and Coding Theory 3 (4), 345-364, 2016	25	2016
MDS code constructions with small sub-packetization and near-optimal repair bandwidth AS Rawat, I Tamo, V Guruswami, K Efremenko IEEE Transactions on Information Theory 64 (10), 6506-6525, 2018	24	2018
Optimal rebuilding of multiple erasures in MDS codes Z Wang, I Tamo, J Bruck IEEE Transactions on Information Theory 63 (2), 1084-1101, 2016	24	2016

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Ladda upp PDF

Följ den här författaren

Citeras av

Medförfattare