Publications


Google Scholar
DBLP

Working papers

  1. Z. Deng, V. Ramkumar, and N. Raviv, “Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets,” arXiv:2405.05567 [cs.IT], in submission, 2024.
  2. V. Ramkumar, N. Raviv, and I. Tamo, “epsilon-MSR Codes for Any Set of Helper Nodes,” arXiv:2408.16584 [cs.IT], 2024.
  3. C. Wang and N. Raviv, “On the Encoding Process in Decentralized Systems,” arXiv:2408.15203 [cs.DC], 2024. [full version of All-to-all Encode in Synchronous Systems, ITW22].
  4. Z. Deng, V. Ramkumar, R. Bitar, and N. Raviv, “Private Inference in Quantized Models,” arXiv:2311.13686 [cs.IT], 2023.
  5. B. Yaghooti, N. Raviv, and B. Sinopoli, “Gram-Schmidt Methods for Unsupervised Feature Extraction and Selection,” arXiv:2311.09386 [cs.LG], 2023.
  6. C. Wang, J. Sima, and N. Raviv, “Break-Resilient Codes for Forensic 3D Fingerprinting,” arXiv:2310.03897 [cs.IT], 2023.

Journals

  1. J. Sima, N. Raviv, and J. Bruck, “Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions,” to appear in IEEE Transactions on Information Theory, arXiv:2308.07793 [cs.IT], 2024.
  2. V. Ramkumar, N. Raviv, and I. Tamo, “Access-Redundancy Tradeoffs in Quantized Linear Computations,” to appear in IEEE Transactions on Information Theory, 2024.
  3. N. Raviv, “Linear codes for hyperdimensional computing,” Neural Computation, 36 (6): 1084–1120, 2024.
  4. C. Wang and N.Raviv, “Breaking Blockchain’s Communication Barrier with Coded Computation,” IEEE Journal on Selected Areas in Information Theory, 2022.
  5. S. Jain, B. Mazaheri, N. Raviv, and J. Bruck. “Glioblastoma signature in the DNA of blood-derived cells,” PloS one 16, no. 9 (2021): e0256831.
  6. J. Sima, N. Raviv, and J. Bruck, “On coding over sliced information,” IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2793-2807, 2021.
  7. N. Raviv, I. Tamo, R. Tandon, A. G. Dimakis, “Gradient coding from cyclic MDS codes and expander graphs,” IEEE Transactions on Information Theory, vol. 66, no. 12, pp. 7475-7489, 2020.
  8. N. Raviv, M. Schwartz, R. Cohen, and Y. Cassuto, “Hierarchical Erasure Correction of Linear Codes“, Finite Fields and Their Applications, 68 (2020): 101743.
  9. N. Raviv, I. Tamo, and E. Yaakobi, “Private information retrieval in graph-based replication systems,” Transactions on Information Theory, vol. 66, no. 6, pp. 3590-3602, 2020.
  10. J. Sima, N. Raviv, and J. Bruck, “Two deletion correcting codes from indicator vectors,” IEEE Transactions on Information Theory, vol. 66, no. 4, pp. 2375-2391, 2019.
  11. 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.
  12. 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.
  13. 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.
  14. N. Raviv, “Asymptotically optimal regenerating codes over any field,” IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7178-7187, 2018.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. T. Etzion and N. Raviv, “Equidistant codes in the Grassmannian,” Discrete Applied Mathematics, vol. 186, pp. 87-97, 2015.

Conference Proceedings

  1. C. Wang, J. Wang, M. Zhou, V. Pham, S. Hao, C. Zhou, N. Zhang, N. Raviv, “Secure Information Embedding in Forensic 3D Fingerprinting,” to appear in USENIX Security Symposium, 2025.
  2. B. Yaghooti, N. Raviv, and B. Sinopoli, “Beyond PCA: A Gram-Schmidt Approach to Feature Extraction,” to appear in the 60th Annual Allerton Conference on Communication, Control, and Computing, 2024.
  3. B. Yaghooti, N. Raviv, and B. Sinopoli, “Gram-Schmidt Methods for Unsupervised Feature Selection,” to appear in IEEE Conference on Decision and Control (CDC), 2024.
  4. C. Wang, J. Sima, and N. Raviv, “Break-Resilient Codes for Forensic 3D Fingerprinting,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
  5. Z. Deng, V. Ramkumar, and N. Raviv, “Perfect Subset Privacy in Polynomial Computation,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
  6. V. Ramkumar, N. Raviv, and I. Tamo, “Non-binary Covering Codes for Low-Access Computations,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
  7. A. Lyu, A. Clark, and N. Raviv, “Explicit Formula for Partial Information Decomposition,” International Symposium on Information Theory (ISIT), 2024 [arXiv].
  8. V. Ramkumar, N. Raviv and I. Tamo, “Coefficient Complexity in Low-Access Quantized Linear Computations“, 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2023.
  9. I. Tennenhouse and N. Raviv, “Transaction Confirmation in Coded Blockchain,” International Symposium on Information Theory (ISIT), 2023 [arXiv].
  10. B. Langton and N. Raviv, “A Generalized Covering Algorithm for Chained Codes,” International Symposium on Information Theory (ISIT), 2023 [arXiv].
  11. Z. Deng and N. Raviv, “Approximate Private Inference in Quantized Models,” International Symposium on Information Theory (ISIT), 2023 [arXiv].
  12. V. Ramkumar, N. Raviv, and I. Tamo, “Access-Redundancy Tradeoffs in Quantized Linear Computations, ” International Symposium on Information Theory (ISIT), 2023 [arXiv].
  13. X. Zuo, A. Jiang, N. Raviv, and P. H. Siegel, “Symbolic Regression for Data Storage with Side Information,” (invited paper), Information Theory Workshop (ITW), 2022.
  14. C. Wang and N. Raviv, “Breaking Blockchain’s Communication Barrier with Coded Computation,” Information Theory Workshop (ITW), 2022.
  15. C. Wang and N. Raviv, “All-to-all Encode in Synchronous Systems,” Information Theory Workshop (ITW), 2022.
  16. N. Raviv, R. Bitar, and E. Yaakobi, “Information Theoretic Private Inference in Quantized Models,” International Symposium on Information Theory (ISIT), 2022.
  17. N. Raviv and Z. Goldfeld, “Perfect Subset Privacy for Data Sharing and Learning,” International Symposium on Information Theory (ISIT), 2022.
  18. N. Raviv, A. Kelley, M. Guo, and E. Vorobeychik, “Enhancing Robustness of Neural Networks through Fourier Stabilization,” International Conference on Machine Learning (ICML), 2021.
  19. C. Wang and N. Raviv, “Low Latency Cross-Shard Transactions in Coded Blockchain,” IEEE International Symposium on Information Theory (ISIT), pp. 2678-2683, 2021.
  20. N. Raviv, B. Langton, and I. Tamo, “Multivariate public key cryptosystem from Sidon spaces”, Public-Key Cryptography (PKC), pp. 242-265, 2021.
  21. N. Raviv, “Robust Neural Computation from Error Correcting Codes” (invited paper), IEEE Information Theory Workshop, (ITW), 2020.
  22. H. Yildiz, N. Raviv, and B. Hassibi, “Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero,” International Symposium on Information Theory (ISIT), 2020.
  23. N. Raviv, S. Jain, P. Upadhyaya, J. Bruck, and A. Jiang, “CodNN – Robust Neural Networks From Coded Classification,” International Symposium on Information Theory (ISIT), 2020.
  24. J. Sima, N. Raviv, J. Bruck, “Robust Indexing — Optimal Codes for DNA Storage,” International Symposium on Information Theory (ISIT), 2020.
  25. N. Raviv, S. Jain, and J. Bruck, “What is the value of data? On mathematical methods for data quality estimation,” International Symposium on Information Theory (ISIT), 2020.
  26. N. Raviv, P. Upadhyaya, S. Jain, J. Bruck, and A. Jiang, “Coded Deep Neural Networks for Robust Neural Computation,” Annual Non-volatile Memories Workshop (NVMW), 2020.
  27. J. Sima, N. Raviv, and J. Bruck, “On coding over sliced information,” International Symposium on Information Theory (ISIT), 2019.
  28. N. Raviv and D. A. Karpuk, “Private polynomial computation from Lagrange encoding,” International Symposium on Information Theory (ISIT), 2019.
  29. N. Raviv, Q. Yu, J. Bruck, and S. Avestimehr, “Download and access tradeoffs in Lagrange coded computing,” International Symposium on Information Theory (ISIT), 2019.
  30. 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.
  31. 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.
  32. Q. Yu, N. Raviv, and S. Avestimehr, “Coding for private and secure multiparty computing” (invited paper), Information Theory Workshop (ITW), 2018.
  33. 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.
  34. J. Sima, N. Raviv, and J. Bruck, “Two deletion correcting codes from indicator vectors,” International Symposium on Information Theory (ISIT), 2018.
  35. N. Raviv and I. Tamo, “Private information retrieval in graph-based replication systems,” International Symposium on Information Theory (ISIT), 2018.
  36. 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.
  37. S. Jain, N. Raviv, and J. Bruck, “Attaining the 2nd Chargaff Rule by Tandem Duplications,” International Symposium on Information Theory (ISIT), 2018.
  38. N. Raviv, E. Yaakobi, and M. Schwartz, “Rank modulation codes for DNA storage,” International Symposium on Information Theory (ISIT), pp. 3125-3129, 2017.
  39. N. Raviv and I. Tamo, “Cyclic subspace codes and Sidon spaces,” International Symposium on Information Theory (ISIT), pp. 784-788, 2017.
  40. N. Raviv, “Asymptotically optimal regenerating codes over any field,” International Symposium on Information Theory (ISIT), pp. 1416-1420, 2017.
  41. N. Raviv, E. Yaakobi, and M. Médard, “Coding for locality in reconstructing permutations,” International Symposium on Information Theory (ISIT), pp. 450-454 , 2016.
  42. 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.
  43. 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.
  44. N. Raviv and T. Etzion, “Distributed storage systems based on intersecting subspace codes,” International Symposium on Information Theory (ISIT), pp. 1462-1466, 2015.
  45. 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.