Publications

Google Scholar
DBLP

(click the title to follow the link)

Journals

  1. 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.
  2. N. Raviv, “Asymptotically optimal regenerating codes over any field,” IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7178-7187, 2018.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. T. Etzion and N. Raviv, “Equidistant codes in the Grassmannian,” Discrete Applied Mathematics, vol. 186, pp. 87-97, 2015.

Conference Proceedings

  1. 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.
  2. Q. Yu, N. Raviv, and S. Avestimehr, “Coding for Private and Secure Multiparty Computing” (invited paper), Information Theory Workshop (ITW), 2018.
  3. 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.
  4. J. Sima, N. Raviv, and J. Bruck, “Two deletion correcting codes from indicator vectors,” International Symposium on Information Theory (ISIT), 2018.
  5. N. Raviv and I. Tamo, “Private information retrieval in graph-based replication systems,” International Symposium on Information Theory (ISIT), 2018.
  6. 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.
  7. S. Jain, N. Raviv, and J. Bruck, “Attaining the 2nd Chargaff Rule by Tandem Duplications,” International Symposium on Information Theory (ISIT), 2018.
  8. N. Raviv, E. Yaakobi, and M. Schwartz, “Rank modulation codes for DNA storage,” International Symposium on Information Theory (ISIT), pp. 3125-3129, 2017.
  9. N. Raviv and I. Tamo, “Cyclic subspace codes and Sidon spaces,” International Symposium on Information Theory (ISIT), pp. 784-788, 2017.
  10. N. Raviv, “Asymptotically optimal regenerating codes over any field,” International Symposium on Information Theory (ISIT), pp. 1416-1420, 2017.
  11. N. Raviv, E. Yaakobi, and M. Médard, “Coding for locality in reconstructing permutations,” International Symposium on Information Theory (ISIT), pp. 450-454 , 2016.
  12. 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.
  13. 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.
  14. N. Raviv and T. Etzion, “Distributed storage systems based on intersecting subspace codes,” International Symposium on Information Theory (ISIT), pp. 1462-1466, 2015.
  15. 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.

Working papers

  1. R. Cohen, N. Raviv, and Y. Cassuto, “LDPC codes over the q-ary Multi-Bit channel,” arXiv:1706.09146 [cs.IT], 2017. Submitted to Transactions on Information Theory.
  2. Q. Yu, N. Raviv, J. So, and A. S. Avestimehr, “Lagrange coded computing: optimal design for resiliency, security and privacy,” arXiv:1806.00939 [cs.IT], 2018.
  3. J. Sima, N. Raviv, and J. Bruck, “Two deletion correcting codes from indicator vectors,” arXiv:1806.09240 [cs.IT], 2018. Submitted to Transactions on Information Theory.
  4. J. Sima, N. Raviv, and J. Bruck, “On coding over sliced information,” arXiv:1809.02716 [cs.IT], 2018.
  5. 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.
  6. 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.
  7. N. Raviv, I. Tamo, and E. Yaakobi, “Private information retrieval in graph-based replication systems,” arXiv:1812.01566 [cs.IT], 2018.
  8. N. Raviv and D. A. Karpuk, “Private Polynomial Computation from Lagrange Encoding“, arXiv:1812.04142 [cs.IT], 2018. Submitted to Transactions on Information Forensics and Security.
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