| Optimal locally repairable and secure codes for distributed storage systems AS Rawat, OO Koyluoglu, N Silberstein, S Vishwanath IEEE Transactions on Information Theory 60 (1), 212-236, 2013 | 296 | 2013 |
| Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams T Etzion, N Silberstein IEEE Transactions on Information Theory 55 (7), 2909-2919, 2009 | 226 | 2009 |
| Optimal locally repairable codes via rank-metric codes N Silberstein, AS Rawat, OO Koyluoglu, S Vishwanath 2013 IEEE International Symposium on Information Theory, 1819-1823, 2013 | 210 | 2013 |
| Codes and designs related to lifted MRD codes T Etzion, N Silberstein IEEE Transactions on Information Theory 59 (2), 1004-1017, 2012 | 133 | 2012 |
| Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks N Silberstein, AL Trautmann IEEE Transactions on Information Theory 61 (7), 3937-3953, 2015 | 78 | 2015 |
| Optimal fractional repetition codes based on graphs and designs N Silberstein, T Etzion IEEE Transactions on Information Theory 61 (8), 4164-4180, 2015 | 68* | 2015 |
| Error resilience in distributed storage via rank-metric codes N Silberstein, AS Rawat, S Vishwanath 2012 50th Annual Allerton Conference on Communication, Control, and …, 2012 | 60 | 2012 |
| Optimal binary locally repairable codes via anticodes N Silberstein, A Zeh 2015 IEEE International Symposium on Information Theory (ISIT), 1247-1251, 2015 | 59 | 2015 |
| Explicit MBR all-symbol locality codes GM Kamath, N Silberstein, N Prakash, AS Rawat, V Lalitha, OO Koyluoglu, ... 2013 IEEE International Symposium on Information Theory, 504-508, 2013 | 57 | 2013 |
| Constructions of high-rate minimum storage regenerating codes over small fields N Raviv, N Silberstein, T Etzion IEEE Transactions on Information Theory 63 (4), 2015-2038, 2017 | 52 | 2017 |
| Large constant dimension codes and lexicodes N Silberstein, T Etzion arXiv preprint arXiv:1003.4879, 2010 | 46 | 2010 |
| Optimal combinatorial batch codes based on block designs N Silberstein, A Gál Designs, Codes and Cryptography 78 (2), 409-424, 2016 | 45 | 2016 |
| Enumerative coding for Grassmannian space N Silberstein, T Etzion IEEE transactions on information theory 57 (1), 365-374, 2010 | 40 | 2010 |
| Error-correcting regenerating and locally repairable codes via rank-metric codes N Silberstein, AS Rawat, S Vishwanath IEEE Transactions on Information Theory 61 (11), 5765-5778, 2015 | 36 | 2015 |
| Locality and availability of array codes constructed from subspaces N Silberstein, T Etzion, M Schwartz IEEE Transactions on Information Theory 65 (5), 2648-2660, 2018 | 28 | 2018 |
| Network coding and subspace designs M Greferath, MO Pavčević, N Silberstein, MÁ Vázquez-Castro Springer, 2018 | 24 | 2018 |
| New lower bounds for constant dimension codes N Silberstein, AL Trautmann 2013 IEEE International Symposium on Information Theory, 514-518, 2013 | 20 | 2013 |
| Anticode-based locally repairable codes with high availability N Silberstein, A Zeh Designs, Codes and Cryptography 86, 419-445, 2018 | 19 | 2018 |
| On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes J Rosenthal, N Silberstein, AL Trautmann Designs, codes and cryptography 73, 393-416, 2014 | 17 | 2014 |
| Method and system for providing subscribe and unsubscribe recommendations L Lewin-Eytan, I Gamzu, N Silberstein, I McCarthy, OS Somekh, K Baruch, ... US Patent 11,361,038, 2022 | 16 | 2022 |
tuvi etzionComputer Science, Technion, IsraelDirección de correo verificada de cs.technion.ac.il
