| A family of optimal locally recoverable codes I Tamo, A Barg IEEE Transactions on Information Theory 60 (8), 4661-4676, 2014 | 630 | 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 | 398 | 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 | 275 | 2016 |
| 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 | 223 | 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 | 159 | 2016 |
| Locally recoverable codes on algebraic curves A Barg, I Tamo, S Vlăduţ IEEE Transactions on Information Theory 63 (8), 4928-4939, 2017 | 127 | 2017 |
| Access versus bandwidth in codes for storage I Tamo, Z Wang, J Bruck IEEE Transactions on Information Theory 60 (4), 2028-2037, 2014 | 117* | 2014 |
| Correcting limited-magnitude errors in the rank-modulation scheme I Tamo, M Schwartz IEEE Transactions on Information Theory 56 (6), 2551-2560, 2010 | 109 | 2010 |
| Bounds on locally recoverable codes with multiple recovering sets I Tamo, A Barg 2014 IEEE International Symposium on Information Theory, 691-695, 2014 | 106 | 2014 |
| On codes for optimal rebuilding access Z Wang, I Tamo, J Bruck 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011 | 101 | 2011 |
| 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 | 96 | 2015 |
| MDS array codes with optimal rebuilding I Tamo, Z Wang, J Bruck 2011 IEEE International Symposium on Information Theory Proceedings, 1240-1244, 2011 | 84 | 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 | 83 | 2014 |
| 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 | 77 | 2017 |
| Explicit minimum storage regenerating codes Z Wang, I Tamo, J Bruck IEEE Transactions on Information Theory 62 (8), 4466-4480, 2016 | 74 | 2016 |
| Long MDS codes for optimal repair bandwidth Z Wang, I Tamo, J Bruck 2012 IEEE International Symposium on Information Theory Proceedings, 1182-1186, 2012 | 73 | 2012 |
| Private information retrieval in graph-based replication systems N Raviv, I Tamo, E Yaakobi IEEE Transactions on Information Theory 66 (6), 3590-3602, 2019 | 62 | 2019 |
| 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 | 57 | 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 | 57 | 2016 |
| The repair problem for Reed–Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size I Tamo, M Ye, A Barg IEEE Transactions on Information Theory 65 (5), 2673-2695, 2018 | 56 | 2018 |
Alexander BargUniversity of Maryland確認したメール アドレス: umd.edu