Itzhak Tamo

Citeras av

	Alla	Sedan 2016
Citat	2290	1851
h-index	22	22
i10-index	32	31

400

200

100

300

20102011201220132014201520162017201820192020202111 21 30 71 126 169 252 338 339 329 384 199

Offentlig åtkomst

Visa alla

18 artiklar

6 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

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
Netanel RavivWashington University in St. LouisVerifierad e-postadress på email.wustl.edu
Alexandros G DimakisProfessor, ECE University of Texas at AustinVerifierad e-postadress på austin.utexas.edu
Moshe SchwartzElectrical and Computer Engineering, Ben-Gurion University of the Negev, IsraelVerifierad e-postadress på ee.bgu.ac.il
Chong Shangguan（上官冲）Shandong UniversityVerifierad e-postadress på zju.edu.cn
Min YeTsinghua-Berkeley Shenzhen InstituteVerifierad e-postadress på sz.tsinghua.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
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
Alexey FrolovSkolkovo Institute of Science and TechnologyVerifierad e-postadress på skoltech.ru
Ankit Singh RawatResearch Scientist, GoogleVerifierad e-postadress på google.com
Serge VladutsProfessor of Mathematics, Aix-Marseille UniversityVerifierad e-postadress på univ-amu.fr
Gala YadgarComputer Science, Technion- Israel Institute of TechnologyVerifierad e-postadress på cs.technion.ac.il
Rashish TandonAppleVerifierad e-postadress på apple.com
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	426	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	307	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	193	2016
Bounds on the parameters of locally recoverable codes I Tamo, A Barg, A Frolov IEEE Transactions on information theory 62 (6), 3070-3083, 2016	100	2016
Correcting limited-magnitude errors in the rank-modulation scheme I Tamo, M Schwartz IEEE Transactions on Information Theory 56 (6), 2551-2560, 2010	95	2010
Access versus bandwidth in codes for storage I Tamo, Z Wang, J Bruck IEEE Transactions on Information Theory 60 (4), 2028-2037, 2014	92*	2014
Bounds on locally recoverable codes with multiple recovering sets I Tamo, A Barg 2014 IEEE International Symposium on Information Theory, 691-695, 2014	84	2014
On codes for optimal rebuilding access Z Wang, I Tamo, J Bruck 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011	83	2011
MDS array codes with optimal rebuilding I Tamo, Z Wang, J Bruck 2011 IEEE International Symposium on Information Theory Proceedings, 1240-1244, 2011	79	2011
Gradient coding from cyclic MDS codes and expander graphs N Raviv, I Tamo, R Tandon, AG Dimakis IEEE Transactions on Information Theory 66 (12), 7475-7489, 2020	69	2020
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	67	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	65	2015
Locally recoverable codes on algebraic curves A Barg, I Tamo, S Vlăduţ IEEE Transactions on Information Theory 63 (8), 4928-4939, 2017	63	2017
Long MDS codes for optimal repair bandwidth Z Wang, I Tamo, J Bruck 2012 IEEE International Symposium on Information Theory Proceedings, 1182-1186, 2012	59	2012
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	54	2018
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	42	2017
Explicit minimum storage regenerating codes Z Wang, I Tamo, J Bruck IEEE Transactions on Information Theory 62 (8), 4466-4480, 2016	40	2016
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	33	2016
Private information retrieval in graph-based replication systems N Raviv, I Tamo, E Yaakobi IEEE Transactions on Information Theory 66 (6), 3590-3602, 2019	29	2019
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	28	2018

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

Följ den här författaren

Citeras av

Medförfattare