Publications

Google Scholar
DBLP

(click the title to follow the link)

Journals

  1. J. Sima, N. Raviv, and J. Bruck, “Two deletion correcting codes from indicator vectors,” arXiv:1806.09240 [cs.IT], 2018. To appear in Transactions on Information Theory.
  2. N. Raviv and D. A. Karpuk, “Private Polynomial Computation from Lagrange Encoding“, Transactions on Information Forensics and Security, vol. 15, no. 1, pp. 553-563, 2019.
  3. R. Cohen, N. Raviv, and Y. Cassuto, “LDPC codes over the q-ary Multi-Bit channel,” arXiv:1706.09146 [cs.IT], 2017. To appear in Transactions on Information Theory.
  4. N. Raviv, M. Schwartz, and E. Yaakobi,  “Rank modulation codes for DNA storage with shotgun sequencing,” IEEE Transactions on Information Theory, vol. 64, no. 12, pp. 1–15, 2018.
  5. N. Raviv, “Asymptotically optimal regenerating codes over any field,” IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7178-7187, 2018.
  6. Ron. M. Roth, N. Raviv, and I. Tamo, “Constructions of Sidon spaces with applications to coding,” IEEE Transactions on Information Theory, vol. 64, no. 6, pp. 4412-4422, 2018.
  7. N. Raviv, E. Yaakobi, and M. Médard, “Coding for locality in reconstructing permutations,” Designs, Codes and Cryptography, vol. 86, no. 2, pp. 387-418, 2017.
  8. N. Raviv, N. Silberstein, and T. Etzion, “Construction of high rate minimum storage regenerating codes over small fields,” IEEE Transactions on Information Theory, vol. 63, no. 4, pp. 2015-2038, 2017.
  9. N. Raviv and A. Wachter-Zeh, “Some Gabidulin codes cannot be list decoded efficiently at any radius,” IEEE Transactions on Information Theory, vol. 62, no. 4, pp. 1605-1615, 2016.
  10. E. Ben-Sasson, T. Etzion, A. Gabizon, and N. Raviv, “Subspace polynomials and cyclic subspace codes,” IEEE Transactions on Information Theory, vol. 62, no. 3, pp. 1157-1165, 2016.
  11. T. Etzion and N. Raviv, “Equidistant codes in the Grassmannian,” Discrete Applied Mathematics, vol. 186, pp. 87-97, 2015.

Conference Proceedings

  1. J. Sima, N. Raviv, and J. Bruck, “On coding over sliced information,” to appear in International Symposium on Information Theory (ISIT), 2019.
  2. N. Raviv and D. A. Karpuk, “Private polynomial computation from Lagrange encoding,” to appear in International Symposium on Information Theory (ISIT), 2019.
  3. N. Raviv, Q. Yu, J. Bruck, and S. Avestimehr, “Download and access tradeoffs in Lagrange coded computing,” to appear in International Symposium on Information Theory (ISIT), 2019.
  4. Q. Yu, S. Li, N. Raviv, S. M. M. Kalan, M. Soltanolkotabi, S. Avestimehr, “Lagrange Coded Computing: Optimal design for resiliency, security, and privacy“, The International Conference on Artificial Intelligence and Statistics (AISTATS), 2019.
  5. Q. Yu, S. Li, N. Raviv, S. M. M. Kalan, M. Soltanolkotabi, S. Avestimehr, “Lagrange Coded Computing: Optimal design for resiliency, security, and privacy,” Systems for Machine Learning Workshop (SYSML) at Advances in Neural Information Processing Systems (NIPS), 2018.
  6. Q. Yu, N. Raviv, and S. Avestimehr, “Coding for private and secure multiparty computing” (invited paper), Information Theory Workshop (ITW), 2018.
  7. N. Raviv, I. Tamo, R. Tandon, A. G. Dimakis, “Gradient coding from cyclic MDS codes and expander graphs,” International Conference on Machine Learning (ICML), 2018.
  8. J. Sima, N. Raviv, and J. Bruck, “Two deletion correcting codes from indicator vectors,” International Symposium on Information Theory (ISIT), 2018.
  9. N. Raviv and I. Tamo, “Private information retrieval in graph-based replication systems,” International Symposium on Information Theory (ISIT), 2018.
  10. N. Raviv, Y. Cassuto, R. Cohen, and M. Schwartz, “Erasure correction of scalar codes in the presence of stragglers,” International Symposium on Information Theory (ISIT), 2018.
  11. S. Jain, N. Raviv, and J. Bruck, “Attaining the 2nd Chargaff Rule by Tandem Duplications,” International Symposium on Information Theory (ISIT), 2018.
  12. N. Raviv, E. Yaakobi, and M. Schwartz, “Rank modulation codes for DNA storage,” International Symposium on Information Theory (ISIT), pp. 3125-3129, 2017.
  13. N. Raviv and I. Tamo, “Cyclic subspace codes and Sidon spaces,” International Symposium on Information Theory (ISIT), pp. 784-788, 2017.
  14. N. Raviv, “Asymptotically optimal regenerating codes over any field,” International Symposium on Information Theory (ISIT), pp. 1416-1420, 2017.
  15. N. Raviv, E. Yaakobi, and M. Médard, “Coding for locality in reconstructing permutations,” International Symposium on Information Theory (ISIT), pp. 450-454 , 2016.
  16. N. Raviv, N. Silberstein, and T. Etzion, “Construction of high rate MSR codes over small fields,” International Symposium on Information Theory (ISIT), pp. 61-65, 2016.
  17. E. Ben-Sasson, T. Etzion, A. Gabizon, and N. Raviv, “Subspace polynomials and cyclic subspace codes,” International Symposium on Information Theory (ISIT), pp. 586-590, 2015.
  18. N. Raviv and T. Etzion, “Distributed storage systems based on intersecting subspace codes,” International Symposium on Information Theory (ISIT), pp. 1462-1466, 2015.
  19. N. Raviv and A. Wachter-Zeh, “Some Gabidulin codes cannot be List decoded efficiently any radius,” International Symposium on Information Theory (ISIT), pp. 6-10, 2015.

Conference presentations

  1. N. Raviv, Q. Yu, J. Bruck, and S. Avestimehr, “Universally Decodable Matrices and Coded Computing”, in CodML Workshop at the International Conference on Machine Learning (ICML), 2019.
  2. N. Raviv, S. Jain, and J. Bruck, “Data Equals Money, But How Much? On Mathematical Methods for Data Pricing”, in CodML Workshop at the International Conference on Machine Learning (ICML), 2019.
  3. N. Raviv and D. A. Karpuk, “Private polynomial computation from Lagrange encoding,” in Information Theory and Applications (ITA), 2019.
  4. N. Raviv, Y. Cassuto, R. Cohen, and M. Schwartz, “Erasure correction of scalar codes in the presence of stragglers,” in Information Theory and Applications (ITA), 2018.
  5. N. Raviv, M. Schwartz, and E. Yaakobi,  “Rank modulation codes for DNA storage with shotgun sequencing,” in Information Theory and Applications (ITA), 2017.

Working papers

  1. J. Sima, N. Raviv, and J. Bruck, “On coding over sliced information,” arXiv:1809.02716 [cs.IT], 2018.
  2. N. Raviv, I. Tamo, R. Tandon, A. G. Dimakis, “Gradient coding from cyclic MDS codes and expander graphs,” arXiv:1707.03858 [cs.IT], 2017. Submitted to Transactions on Information Theory.
  3. N. Raviv, Y. Cassuto, R. Cohen, and M. Schwartz, “Erasure correction of scalar codes in the presence of stragglers,” arXiv:1802.02265 [cs.IT], 2018.
  4. N. Raviv, I. Tamo, and E. Yaakobi, “Private information retrieval in graph-based replication systems,” arXiv:1812.01566 [cs.IT], 2018.
  5. S. Jain, B. Mazaheri, N. Raviv, and J. Bruck, “Short tandem repeats information in TCGA is statistically biased by amplification,” bioRxiv 518878, 2019.
  6. S. Jain, B. Mazaheri, N. Raviv, and J. Bruck, “Cancer Classification from Healthy DNA using Machine Learning,” bioRxiv 517839, 2019.
Advertisements
Create your website at WordPress.com
Get started
%d bloggers like this:
search previous next tag category expand menu location phone mail time cart zoom edit close