| Lagrange coded computing: Optimal design for resiliency, security, and privacy Q Yu, S Li, N Raviv, SMM Kalan, M Soltanolkotabi, SA Avestimehr The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 303 | 2019 |
| 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 | 114 | 2020 |
| 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 | 72 | 2018 |
| Subspace polynomials and cyclic subspace codes E Ben-Sasson, T Etzion, A Gabizon, N Raviv IEEE Transactions on Information Theory 62 (3), 1157-1165, 2016 | 68 | 2016 |
| 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 | 48 | 2017 |
| Private information retrieval in graph-based replication systems N Raviv, I Tamo, E Yaakobi IEEE Transactions on Information Theory 66 (6), 3590-3602, 2019 | 43 | 2019 |
| Two deletion correcting codes from indicator vectors J Sima, N Raviv, J Bruck IEEE transactions on information theory 66 (4), 2375-2391, 2019 | 40 | 2019 |
| On coding over sliced information J Sima, N Raviv, J Bruck IEEE Transactions on Information Theory 67 (5), 2793-2807, 2021 | 33 | 2021 |
| Construction of Sidon spaces with applications to coding RM Roth, N Raviv, I Tamo IEEE Transactions on Information Theory 64 (6), 4412-4422, 2017 | 33 | 2017 |
| Equidistant codes in the Grassmannian T Etzion, N Raviv Discrete Applied Mathematics 186, 87-97, 2015 | 33 | 2015 |
| Private polynomial computation from Lagrange encoding N Raviv, DA Karpuk IEEE Transactions on Information Forensics and Security 15, 553-563, 2019 | 32 | 2019 |
| Some Gabidulin codes cannot be list decoded efficiently at any radius N Raviv, A Wachter-Zeh IEEE Transactions on Information Theory 62 (4), 1605-1615, 2016 | 32 | 2016 |
| Distributed storage systems based on intersecting subspace codes N Raviv, T Etzion 2015 IEEE International Symposium on Information Theory (ISIT), 1462-1466, 2015 | 13 | 2015 |
| Rank-modulation codes for DNA storage with shotgun sequencing N Raviv, M Schwartz, E Yaakobi IEEE Transactions on Information Theory 65 (1), 50-64, 2018 | 12 | 2018 |
| Low latency cross-shard transactions in coded blockchain C Wang, N Raviv 2021 IEEE International Symposium on Information Theory (ISIT), 2678-2683, 2021 | 10 | 2021 |
| Robust indexing-optimal codes for DNA storage J Sima, N Raviv, J Bruck 2020 IEEE International Symposium on Information Theory (ISIT), 717-722, 2020 | 10 | 2020 |
| Some Gabidulin codes cannot be list decoded efficiently at any radius N Raviv, A Wachter-Zeh 2015 IEEE International Symposium on Information Theory (ISIT), 6-10, 2015 | 10 | 2015 |
| Codnn–robust neural networks from coded classification N Raviv, S Jain, P Upadhyaya, J Bruck, AA Jiang 2020 IEEE International Symposium on Information Theory (ISIT), 2688-2693, 2020 | 7 | 2020 |
| Coding for private and secure multiparty computing Q Yu, N Raviv, AS Avestimehr 2018 IEEE Information Theory Workshop (ITW), 1-5, 2018 | 7 | 2018 |
| Constructions of high-rate MSR codes over small fields N Raviv, N Silberstein, T Etzion arXiv preprint arXiv:1505.00919, 2015 | 7 | 2015 |
Jehoshua BruckGordon and Betty Moore Professor, CaltechVerified email at caltech.edu
